[L’arbre lemniscate d’un polynôme aléatoire]
À chaque polynôme complexe générique est associé un arbre binaire étiqueté (appelé dans cet aticle, “arbre de lemniscate”) qui code le type topologique du graphe de . La structure de ramification de l’arbre de lemniscate est déterminée par la configuration (c’est-à-dire la disposition dans le plan) des composants singuliers de ces ensembles de niveaux passant par un point critique.
Dans cet article, nous nous intéressons à la question suivante : combien de branches apparaissent typiquement dans un arbre de lemniscate ? Nous répondons d’abord à cette question pour un arbre de lemniscate échantillonné uniformément dans la classe combinatoire de tous ces arbres associés à un polynôme générique de degré fixé, et ensuite pour un arbre de lemniscate résultant d’un polynôme aléatoire avec des zéros indépendants et identiquement distribués. D’un point de vue plus général, ces résultats constituent un premier pas vers un traitement probabiliste (dans un cadre spécialisé) du programme d’Arnold consistant à énumérer les fonctions algébriques de Morse.
To each generic complex polynomial is associated a labeled binary tree (here referred to as a “lemniscate tree”) that encodes the topological type of the graph of . The branching structure of the lemniscate tree is determined by the configuration (i.e., arrangement in the plane) of the singular components of those level sets passing through a critical point.
In this paper, we ask: how many branches appear in a typical lemniscate tree? We answer this question first for a lemniscate tree sampled uniformly from the combinatorial class of all such trees associated to a generic polynomial of fixed degree and second for the lemniscate tree arising from a random polynomial with i.i.d. zeros. From a more general perspective, these results take a first step toward a probabilistic treatment (within a specialized setting) of Arnold’s program of enumerating algebraic Morse functions.
Révisé le :
Accepté le :
Publié le :
Keywords: random polynomial, binary tree, lemniscate, analytic combinatorics
Mot clés : polynôme aléatoire, arbre binaire, lemniscate, combinatoire analytique
Epstein, Michael 1 ; Hanin, Boris 2 ; Lundberg, Erik 3
CC-BY-ND 4.0
@article{AIF_2020__70_4_1663_0,
author = {Epstein, Michael and Hanin, Boris and Lundberg, Erik},
title = {The lemniscate tree of a random polynomial},
journal = {Annales de l'Institut Fourier},
pages = {1663--1687},
publisher = {Association des Annales de l{\textquoteright}institut Fourier},
volume = {70},
number = {4},
year = {2020},
doi = {10.5802/aif.3377},
language = {en},
url = {https://aif.centre-mersenne.org/articles/10.5802/aif.3377/}
}
TY - JOUR AU - Epstein, Michael AU - Hanin, Boris AU - Lundberg, Erik TI - The lemniscate tree of a random polynomial JO - Annales de l'Institut Fourier PY - 2020 SP - 1663 EP - 1687 VL - 70 IS - 4 PB - Association des Annales de l’institut Fourier UR - https://aif.centre-mersenne.org/articles/10.5802/aif.3377/ DO - 10.5802/aif.3377 LA - en ID - AIF_2020__70_4_1663_0 ER -
%0 Journal Article %A Epstein, Michael %A Hanin, Boris %A Lundberg, Erik %T The lemniscate tree of a random polynomial %J Annales de l'Institut Fourier %D 2020 %P 1663-1687 %V 70 %N 4 %I Association des Annales de l’institut Fourier %U https://aif.centre-mersenne.org/articles/10.5802/aif.3377/ %R 10.5802/aif.3377 %G en %F AIF_2020__70_4_1663_0
Epstein, Michael; Hanin, Boris; Lundberg, Erik. The lemniscate tree of a random polynomial. Annales de l'Institut Fourier, Tome 70 (2020) no. 4, pp. 1663-1687. doi : 10.5802/aif.3377. https://aif.centre-mersenne.org/articles/10.5802/aif.3377/
[1] Topological classification of Morse functions and generalisations of Hilbert’s 16-th problem, Math. Phys. Anal. Geom., Volume 10 (2007) no. 3, pp. 227-236 | DOI | MR | Zbl
[2] Generic lemniscates of algebraic functions, Math. Ann., Volume 307 (1997) no. 3, pp. 417-444 | DOI | MR | Zbl
[3] Varieties of increasing trees, Colloquium on trees in algebra and programming (1992), pp. 24-48
[4] k-Protected vertices in binary search trees, Adv. Appl. Math., Volume 53 (2014), pp. 1-11 | DOI | MR | Zbl
[5] Balanced vertices in labeled rooted trees (2017) (https://arxiv.org/abs/1705.09688)
[6] Limiting probabilities for vertices of a given rank in rooted trees (2018) (https://arxiv.org/abs/1803.05033) | Zbl
[7] On a random search tree: asymptotic enumeration of vertices by distance from leaves, Adv. Appl. Probab., Volume 49 (2017) no. 3, pp. 850-876 | DOI | MR | Zbl
[8] Appendix to “Polynomial-lemniscates, trees and braids”, Topology, Volume 30 (1991) no. 4, pp. 623-640 | DOI
[9] Polynomial-lemniscates, trees and braids, Topology, Volume 30 (1991) no. 4, pp. 623-640 | DOI | MR | Zbl
[10] Matrix models for beta ensembles, J. Math. Phys., Volume 43 (2002) no. 11, pp. 5830-5847 | DOI | MR | Zbl
[11] Computational topology: an introduction, American Mathematical Society, 2010 | Zbl
[12] Analytic combinatorics, Cambridge University Press, 2009 | Zbl
[13] Polynomial lemniscates and their fingerprints: from geometry to topology, Complex analysis and dynamical systems (Trends in Mathematics), Birkhäuser/Springer, 2018, pp. 103-128 | DOI | Zbl
[14] On the number of connected components of random algebraic hypersurfaces, J. Geom. Phys., Volume 95 (2015), pp. 1-20 | DOI | MR | Zbl
[15] Exponential rarefaction of real curves with many components, Publ. Math., Inst. Hautes Étud. Sci., Volume 113 (2011) no. 1, pp. 69-96 | DOI | Numdam | MR | Zbl
[16] Lower estimates for the expected Betti numbers of random real hypersurfaces, J. Lond. Math. Soc., Volume 90 (2014) no. 1, pp. 105-120 | DOI | MR | Zbl
[17] Betti numbers of random real hypersurfaces and determinants of random symmetric matrices, J. Eur. Math. Soc., Volume 18 (2016) no. 4, pp. 733-772 | DOI | MR | Zbl
[18] Correlations and pairing between zeros and critical points of Gaussian random polynomials, Int. Math. Res. Not., Volume 2015 (2015) no. 2, pp. 381-421 | DOI | MR | Zbl
[19] Pairing of zeros and critical points for random meromorphic functions on Riemann surfaces, Math. Res. Lett., Volume 22 (2015) no. 1, pp. 111-140 | DOI | MR | Zbl
[20] Pairing of zeros and critical points for random polynomials, Ann. Inst. Henri Poincaré, Probab. Stat., Volume 53 (2017) no. 3, pp. 1498-1511 | MR | Zbl
[21] Statistics on Hilbert’s 16th problem, Int. Math. Res. Not. (2015) no. 12, pp. 4293-4321 | MR | Zbl
[22] On the geometry of random lemniscates, Proc. Lond. Math. Soc., Volume 113 (2016) no. 5, pp. 649-673 | DOI | MR | Zbl
[23] Expected number of real zeros for random linear combinations of orthogonal polynomials, Proc. Am. Math. Soc., Volume 144 (2016) no. 4, pp. 1631-1642 | DOI | MR | Zbl
[24] The arc length and topology of a random lemniscate, J. Lond. Math. Soc., Volume 96 (2017) no. 3, pp. 621-641 | DOI | MR | Zbl
[25] On the number of nodal domains of random spherical harmonics, Am. J. Math., Volume 131 (2009) no. 5, pp. 1337-1357 | DOI | MR | Zbl
[26] Asymptotic laws for the spatial distribution and the number of connected components of zero sets of Gaussian random functions, J. Math. Phys. Anal. Geom., Volume 12 (2016) no. 3, pp. 205-278 | MR | Zbl
[27] Counting Morse functions on the 2-sphere, Compos. Math., Volume 144 (2008) no. 5, pp. 1081-1106 | DOI | MR | Zbl
[28] Pairing between zeros and critical points of random polynomials with independent roots, Trans. Am. Math. Soc., Volume 371 (2019) no. 4, pp. 2343-2381 | DOI | MR | Zbl
[29] Topologies of Nodal Sets of Random Band-Limited Functions, Commun. Pure Appl. Math., Volume 72 (2019) no. 2, pp. 275-342 | DOI | MR | Zbl
[30] The theory of functions, Oxford University Press, 1939
Cité par Sources :
