Displaying similar documents to “Discussion. Sur une limitation très générale de la dispersion médiane by M. Fréchet”

Système dynamique à spectre discret et pavage périodique associé à une substitution

Anne Siegel (2004)

Annales de l’institut Fourier

Similarity:

On donne une condition combinatoire effective suffisante pour que le sytème dynamique associé à une substitution de type Pisot ait un spectre purement discret. Dans le cas unimodulaire, cette condition est nécessaire dès que la substitution n'a qu'un cobord trivial ; elle est vérifiée si et seulement si le fractal de Rauzy associé à la substitution engendre un pavage auto-similaire et périodique. On en déduit des conditions de connexité des fractals de Rauzy. ...

Moduli spaces for linear differential equations and the Painlevé equations

Marius van der Put, Masa-Hiko Saito (2009)

Annales de l’institut Fourier

Similarity:

A systematic construction of isomonodromic families of connections of rank two on the Riemann sphere is obtained by considering the analytic Riemann–Hilbert map R H : , where is a moduli space of connections and , , is a moduli space for analytic data (, ordinary monodromy, Stokes matrices and links). The assumption that the fibres of R H (, the isomonodromic families) have dimension one, leads to ten moduli spaces . The induced Painlevé equations are computed explicitly. Except for the...

A special type of triangulations in numerical nonlinear analysis.

J. M. Soriano (1990)

Collectanea Mathematica

Similarity:

To calculate the zeros of a map f : Rn → Rn we consider the class of triangulations of Rn so that a certain point belongs to a simplex of fixed diameter and dimension. In this paper two types of this new class of triangulations are constructed and shown to be useful to calculate zeros of piecewise linear approximations of f.

Testing Cayley graph densities

Goulnara N. Arzhantseva, Victor S. Guba, Martin Lustig, Jean-Philippe Préaux (2008)

Annales mathématiques Blaise Pascal

Similarity:

We present a computer-assisted analysis of combinatorial properties of the Cayley graphs of certain finitely generated groups: given a group with a finite set of generators, we study the density of the corresponding Cayley graph, that is, the least upper bound for the average vertex degree (= number of adjacent edges) of any finite subgraph. It is known that an m -generated group is amenable if and only if the density of the corresponding Cayley graph equals to 2 m . We test amenable and...