The plus construction, Postnikov towers and universal central module extensions

Given a connected spaceX, we consider the effect of Quillen’s plus construction on the homotopy groups ofX in terms of its Postnikov decomposition. Specifically, using universal properties of the fibration sequenceAX→X→X ⁺, we explain the contribution of π _n X to π _n X ⁺, π _n+1 X ⁺ and π _n AX, π _n+1 AX explicitly in terms of the low dimensional homology of π _n X regarded as a module over π₁ X. Key ingredients developed here for this purpose are universal II-central fibrations and a theory of universal central extensions of modules, analogous to universal central extensions of perfect groups. Research partially supported by NSERC of Canada.     

Towards the Evaluation of the Relevant Degrees of Freedom in Nonlinear Partial Differential Equations

We investigate an operator renormalization group method to extract and describe the relevant degrees of freedom in the evolution of partial differential equations. The proposed renormalization group approach is formulated as an analytical method providing the fundamental concepts of a numerical algorithm applicable to various dynamical systems. We examine dynamical scaling characteristics in the short-time and the long-time evolution regime providing only a reduced number of degrees of freedom to the evolution process.     

Une nouvelle méthode de raffinement de maillage spatio-temporel pour l'équation des ondes

In the present Note we introduce an extension of the conservative space–time mesh refinement method presented by Fouquet et al. We also propose a post-treatment of the solution that reduces the spurious phenomena due to the non-conformity between the time meshes. A reinterpretation of the equations in terms of new unknowns leads to a new scheme with second order consistent coupling equations. Numerical experiments in 2D and a plane wave analysis for the 1D model show that the method is second order accurate for an arbitrary refinement. To cite this article: J. Rodríguez, C. R. Acad. Sci. Paris, Ser. I 339 (2004).     

Extraction-ability and -selectivity of tetra-aza-crown ethers for transition metal cations

In order to investigate the relative effects of the differences between the structures and lipophilicities of 1, 10-dioxa-4, 7, 13, 16-tetra-azacyclo-octadecane (TA-18-crown-6) and the tetrabenzyl derivative of 1,10-dioxa-4, 7, 13, 16-tetra-azacyclo-octadecane (TBTA-18-crown-6) on their extraction-abilities and -selectivities for transition metal cations, constants of the overall extraction (logK _ex) of 1:1 (M:L) complexes, the distribution (K _D) for two diluents (CH₂Cl₂ and CHCl₃) with different dielectric constants have been determined at 25 ± 0.1 °C. The magnitude of logK _ex is largely determined by that of K _D. The equilibrium constants of TA-18-crown-6 have been compared with those of TBTA-18-crown-6. It is found that:(i) logK _ex sequences of TA-18-crown-6 and TBTA-18-crown-6 for transition metals in CH₂Cl₂ lie in order: Fe³⁺ > Cu²⁺ > Mn²⁺ > Co²⁺ > Cd²⁺ > Ni²⁺ > Zn²⁺ and Fe³⁺ > Cu²⁺ > Co²⁺ > Mn²⁺ > Ni²⁺ > Cd²⁺ > Zn²⁺ respectively; (ii) the stability sequences of two types of tetra-aza-crown ethers with the transition metal cations in CHCl₃ are the same as follows: Fe³⁺ > Ni²⁺ > Cu²⁺ > Co²⁺ > Zn²⁺ > Cd²⁺ > Mn²⁺, and (iii) unusual selectivities are observed for transition metal-tetra-aza-crowns, e.g. the high Fe³⁺/M ⁿ⁺ selectivity factors (S_f) of TA-18-crown-6, except for the competitive-extractions for the special case in CHCl₃ of TBTA-18-crown-6, it was found that the Mn²⁺/M ⁿ⁺ values were relatively higher according to the other transition metal cations. A systematic sequence in these two types of solvents is not found for a given transition metal cation in terms of the variation of selectivity with the tetra-aza-crown ethers. The results provide alternatives for the rational design of other specific ligands on the transition metal cations.     

The auction algorithm for the transportation problem

The auction algorithm is a parallel relaxation method for solving the classical assignment problem. It resembles a competitive bidding process whereby unassigned persons bid simultaneously for objects, thereby raising their prices. Once all bids are in, objects are awarded to the highest bidder. This paper generalizes the auction algorithm to solve linear transportation problems. The idea is to convert the transportation problem into an assignment problem, and then to modify the auction algorithm to exploit the special structure of this problem. Computational results show that this modified version of the auction algorithm is very efficient for certain types of transportation problems.     

FFT-based algorithms for the string matching with mismatches problem

The string matching with mismatches problem requires finding the Hamming distance between a pattern P of length m and every length m substring of text T with length n. Fischer and Paterson's FFT-based algorithm solves the problem without error in O(σnlogm), where σ is the size of the alphabet Σ [SIAM–AMS Proc. 7 (1973) 113–125]. However, this in the worst case reduces to O(nmlogm). Atallah, Chyzak and Dumas used the idea of randomly mapping the letters of the alphabet to complex roots of unity to estimate the score vector in time O(nlogm) [Algorithmica 29 (2001) 468–486]. We show that the algorithm's score variance can be substantially lowered by using a bijective mapping, and specifically to zero in the case of binary and ternary alphabets. This result is extended via alphabet remappings to deterministically solve the string matching with mismatches problem with a constant factor of 2 improvement over Fischer–Paterson's method.     

Partially isometric dilations of noncommuting -tuples of operators

Given a row contraction of operators on a Hilbert space and a family of projections on the space that stabilizes the operators, we show there is a unique minimal joint dilation to a row contraction of partial isometries that satisfy natural relations. For a fixed row contraction the set of all dilations forms a partially ordered set with a largest and smallest element. A key technical device in our analysis is a connection with directed graphs. We use a Wold decomposition for partial isometries to describe the models for these dilations, and we discuss how the basic properties of a dilation depend on the row contraction.