The multidimensional Luzin theorem

Each measurable map of an open set U⊂Rn to Rn is equal almost everywhere to the gradient of a continuous almost everywhere differentiable function defined on Rn that vanishes, together with its gradient, outside U.     

On the global distance between two algebraic points on a curve

We prove diophantine inequalities involving various distances between two distinct algebraic points of an algebraic curve. These estimates may be viewed as extensions of classical Liouville's inequality. Our approach is based on a transcendental construction using algebraic functions. Next we apply our results to Hilbert's irreducibility Theorem and to some classes of diophantine equations in the circle of Runge's method.     

Decay of positive waves for hyperbolic systems of balance laws

We prove Olenik-type decay estimates for entropy solutions of strictly hyperbolic systems of balance laws built out of a wave-front tracking procedure inside which the source term is treated as a nonconservative product localized on a discrete lattice.

     

On the geometric structure of independence systems

A bouquet of matroids is a combinatorial structure that generalizes the properties of matroids. Given an independence system, there exist several bouquets of matroids having the same family of independent sets. We show that the collection of these geometries forms in general a meet semi-lattice and, in some cases, a lattice (for instance, when is the family of the stable sets in a graph). Moreover, one of the bouquets that correspond to the highest elements in the meet semi-lattice provides the smallest decomposition of into matroidal families, such that the rank functions of the different matroids have the same values for common sets. In the last section, we give sharp bounds on the performance of the greedy algorithm, using parameters of some special bouquets in the semi-lattice.     

Domain decomposition for a finite volume method on non-matching grids

We are interested in a robust and accurate domain decomposition method with Robin interface conditions on non-matching grids using a finite volume discretization. We introduce transmission operators on the non-matching grids and define new interface conditions of Robin type. Under a compatibility assumption, we show the equivalence between Robin interface conditions and Dirichlet–Neumann interface conditions and the well-posedness of the global and local problems. Two error estimates are given in terms of the discrete H¹-norm: one in O(h^1/2) with operators based on piecewise constant functions and the other in O(h) (as in the conforming case) with operators using a linear rebuilding. Numerical results are given. To cite this article: L. Saas et al., C. R. Acad. Sci. Paris, Ser. I 338 (2004).     

Growth of permutational extensions

We study the geometry of a class of group extensions, containing permutational wreath products, which we call “permutational extensions”. We construct for all k∈ℕ a torsion group K _k with growth function v_Kk(n) ~ exp(n^1-(1-a)k),       2^3-3/a+2^2-2/a+2^1-1/a=2,v_{K_k}(n)\sim\exp(n^{1-(1-\alpha)^k}),\qquad 2^{3-3/\alpha}+2^{2-2/\alpha}+2^{1-1/\alpha}=2,     

Chebyshev splines and shape parameters

A parametric spline curve is defined whose restriction to each sub-interval belongs to a 4-dimensional piecewise Chebyshev subspace depending on coefficients which play the role of shape parameters. This revised version was published online in August 2006 with corrections to the Cover Date.     

On the computation of a versal family of matrices

The aim of this article is to present algorithms for the computation of versal deformations of matrices. A deformation of a matrixA ₀ is a holomorphic matrix-valued function whose value at a pointt ₀C ^p is the matrixA ₀. We want to study the properties of these matrices in a neighbourhood oft ₀. One could, for each valuet in this neighbourhood, compute the Jordan form as well as the change of basis matrix; but, generally, the results will not be analytic. So, we want to construct a deformation of the matrixA ₀ into which any deformation can be transformed by an invertible deformation of the matrixId. After having introduced the notion of versal deformation, we shall provide computer algebra algorithms to computer these normal forms. In the last section, we shall show that a one-parameter deformation can be transformed into a simpler form than the general versal deformation.