Embeddability of pairs of weighted quasi-arithmetic means into a semiflow

We determine the form of all semiflows of pairs of weighted quasi-arithmetic means, those over positive dyadic numbers as well as the continuous ones. Then the iterability of such pairs is characterized: necessary and sufficient conditions for a given pair of weighted quasi-arithmetic means to be embeddable into a continuous semiflow are given. In particular, it turns out that surprisingly the existence of a square iterative root in the class of such pairs implies the embeddability.

RANDOM SPARSE SAMPLING IN A GIBBS WEIGHTED TREE AND PHASE TRANSITIONS

Let $\unicode[STIX]{x1D707}$ be the projection on $[0,1]$ of a Gibbs measure on $\unicode[STIX]{x1D6F4}=\{0,1\}^{\mathbb{N}}$ (or more generally a Gibbs capacity) associated with a Hölder potential. The thermodynamic and multifractal properties of $\unicode[STIX]{x1D707}$ are well known to be linked via the multifractal formalism. We study the impact of a random sampling procedure on this structure. More precisely, let $\{{I_{w}\}}_{w\in \unicode[STIX]{x1D6F4}^{\ast }}$ stand for the collection of dyadic subintervals of $[0,1]$ naturally indexed by the finite dyadic words. Fix $\unicode[STIX]{x1D702}\in (0,1)$, and a sequence $(p_{w})_{w\in \unicode[STIX]{x1D6F4}^{\ast }}$ of independent Bernoulli variables of parameters $2^{-|w|(1-\unicode[STIX]{x1D702})}$. We consider the (very sparse) remaining values $\widetilde{\unicode[STIX]{x1D707}}=\{\unicode[STIX]{x1D707}(I_{w}):w\in \unicode[STIX]{x1D6F4}^{\ast },p_{w}=1\}$. We study the geometric and statistical information associated with $\widetilde{\unicode[STIX]{x1D707}}$, and the relation between $\widetilde{\unicode[STIX]{x1D707}}$ and $\unicode[STIX]{x1D707}$. To do so, we construct a random capacity $\mathsf{M}_{\unicode[STIX]{x1D707}}$ from $\widetilde{\unicode[STIX]{x1D707}}$. This new object fulfills the multifractal formalism, and its free energy is closely related to that of $\unicode[STIX]{x1D707}$. Moreover, the free energy of $\mathsf{M}_{\unicode[STIX]{x1D707}}$ generically exhibits one first order and one second order phase transition, while that of $\unicode[STIX]{x1D707}$ is analytic. The geometry of $\mathsf{M}_{\unicode[STIX]{x1D707}}$ is deeply related to the combination of approximation by dyadic numbers with geometric properties of Gibbs measures. The possibility to reconstruct $\unicode[STIX]{x1D707}$ from $\widetilde{\unicode[STIX]{x1D707}}$ by using the almost multiplicativity of $\unicode[STIX]{x1D707}$ and concatenation of words is discussed as well.

Formulae and Asymptotics for Coefficients of Algebraic Functions

We study the coefficients of algebraic functions ∑n≥0fnzn. First, we recall the too-little-known fact that these coefficientsfnalways admit a closed form. Then we study their asymptotics, known to be of the typefn~CAnnα. When the function is a power series associated to a context-free grammar, we solve a folklore conjecture: the critical exponents α cannot be 1/3 or −5/2; they in fact belong to a proper subset of the dyadic numbers. We initiate the study of the set of possible values forA. We extend what Philippe Flajolet called the Drmota–Lalley–Woods theorem (which states that α=−3/2 when the dependency graph associated to the algebraic system defining the function is strongly connected). We fully characterize the possible singular behaviours in the non-strongly connected case. As a corollary, the generating functions of certain lattice paths and planar maps are not determined by a context-free grammar (i.e., their generating functions are not ℕ-algebraic). We give examples of Gaussian limit laws (beyond the case of the Drmota–Lalley–Woods theorem), and examples of non-Gaussian limit laws. We then extend our work to systems involving non-polynomial entire functions (non-strongly connected systems, fixed points of entire functions with positive coefficients). We give several closure properties for ℕ-algebraic functions. We end by discussing a few extensions of our results (infinite systems of equations, algorithmic aspects).

Coefficients of algebraic functions: formulae and asymptotics

International audience This paper studies the coefficients of algebraic functions. First, we recall the too-little-known fact that these coefficients $f_n$ have a closed form. Then, we study their asymptotics, known to be of the type $f_n \sim C A^n n^{\alpha}$. When the function is a power series associated to a context-free grammar, we solve a folklore conjecture: the appearing critical exponents $\alpha$ can not be $^1/_3$ or $^{-5}/_2$, they in fact belong to a subset of dyadic numbers. We extend what Philippe Flajolet called the Drmota-Lalley-Woods theorem (which is assuring $\alpha=^{-3}/_2$ as soon as a "dependency graph" associated to the algebraic system defining the function is strongly connected): We fully characterize the possible critical exponents in the non-strongly connected case. As a corollary, it shows that certain lattice paths and planar maps can not be generated by a context-free grammar (i.e., their generating function is not $\mathbb{N}-algebraic). We end by discussing some extensions of this work (limit laws, systems involving non-polynomial entire functions, algorithmic aspects). Cet article a pour héros les coefficients des fonctions algébriques. Après avoir rappelé le fait trop peu connu que ces coefficients $f_n$ admettent toujours une forme close, nous étudions leur asymptotique $f_n \sim C A^n n^{\alpha}$. Lorsque la fonction algébrique est la série génératrice d'une grammaire non-contextuelle, nous résolvons une vieille conjecture du folklore : les exposants critiques $\alpha$ ne peuvent pas être $^1/_3$ ou $^{-5}/_2$ et sont en fait restreints à un sous-ensemble des nombres dyadiques. Nous étendons ce que Philippe Flajolet appelait le théorème de Drmota-Lalley-Woods (qui affirme que $\alpha=^{-3}/_2$ dès lors qu'un "graphe de dépendance" associé au système algébrique est fortement connexe) : nous caractérisons complètement les exposants critiques dans le cas non fortement connexe. Un corolaire immédiat est que certaines marches et cartes planaires ne peuvent pas être engendrées par une grammaire non-contextuelle non ambigüe (i. e., leur série génératrice n'est pas $\mathbb{N}-algébrique). Nous terminons par la discussion de diverses extensions de nos résultats (lois limites, systèmes d'équations de degré infini, aspects algorithmiques).