The lemniscate tree of a random polynomial

DOI10.5802/AIF.3377MaRDI QIDQ2027745zbMATH OpenOpenAlexFDO

Authors Michael Epstein, Boris Hanin, Erik Lundberg

Publication date 28 May 2021

Published in Annales de l’institut Fourier (Search for Journal in Brave)

Copyright license Creative Commons Attribution-NoDerivs 4.0 International

Full work available at URL https://arxiv.org/abs/1806.00521

zbMATH Keywords

analytic combinatoricsbinary treelemniscaterandom polynomial

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Topology of real algebraic varieties (14P25) Zeros of polynomials, rational functions, and other analytic functions of one complex variable (e.g., zeros of functions with bounded Dirichlet integral) (30C15) Potentials and capacity, harmonic measure, extremal length and related notions in two dimensions (31A15) Combinatorial probability (60C05) Central limit and other weak theorems (60F05) Random fields (60G60)

Abstract: To each generic complex polynomial $p(z)$ there is associated a labeled binary tree (here referred to as a "lemniscate tree") that encodes the topological type of the graph of $|p(z)|$. 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 $|p(z)|=t$ passing through a critical point. In this paper, we address the question "How many branches appear in a typical lemniscate tree?" We answer this question first for a lemniscate tree sampled uniformly from the combinatorial class and second for the lemniscate tree arising from a random polynomial generated by 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.

Review text

A polynomial \(p\in \mathbb{C}[z]\) of degree \(n+1\) is called lemniscate generic if \(p'(z)\) has \(n\) distinct zeros \(w_1, \ldots, w_n\) such that for each \(1\leq i \leq n,\) \(p(w_i) \neq 0, \) and \(|p(w_i)|=|p(w_j)|\) if and only if \(i=j.\) To each lemniscate generic polynomial the authors associate a rooted, non-plane, binary tree \(LT(p)\) with \(n\) vertices, which correspond to critical points, and are bijectively labeled with the integers from \(1\) to \(n\). The labels increase along path oriented away from the root, which corresponds to the critical point with the largest value of \(|p|\). The tree \(LT(p)\) encodes the topology of the graph of \(|p(z)|.\) The branching structure of the graph is determined by the arrangement in the plane of the connected components \(\Gamma_w \subseteq \{z\in \mathbb{C}:\ |p(z)|=|p(w)| \}.\) The authors investigate the question of the number of branches in a typical \(LT(p)\). They answer this question for a lemniscate tree sampled uniformly from the combinatorial class of all such trees associated to a generic polynomial of fixed degree as well as 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.

Recommendations

• Polya trees and random distributions
• scientific article; zbMATH DE number 3980169
• On roots of random polynomials
• Trees and the dynamics of polynomials
• The level crossings of random polynomials
• scientific article; zbMATH DE number 503393
• A note on the scaling limits of random Pólya trees
• Random polynomials in Legendre symbol sequences

Cites work

• k-protected vertices in binary search trees
• Analytic combinatorics
• Asymptotic laws for the spatial distribution and the number of connected components of zero sets of Gaussian random functions
• Betti numbers of random real hypersurfaces and determinants of random symmetric matrices
• Computational topology. An introduction
• Correlations and pairing between zeros and critical points of Gaussian random polynomials
• Counting Morse functions on the 2-sphere
• Expected number of real zeros for random linear combinations of orthogonal polynomials
• Exponential rarefaction of real curves with many components
• Generic lemniscates of algebraic functions
• Limiting probabilities for vertices of a given rank in 1-2 trees
• Lower estimates for the expected Betti numbers of random real hypersurfaces
• Matrix models for beta ensembles
• On a random search tree: asymptotic enumeration of vertices by distance from leaves
• On the geometry of random lemniscates
• On the number of connected components of random algebraic hypersurfaces
• On the number of nodal domains of random spherical harmonics
• Pairing between zeros and critical points of random polynomials with independent roots
• Pairing of zeros and critical points for random meromorphic functions on Riemann surfaces
• Pairing of zeros and critical points for random polynomials
• Polynomial lemniscates and their fingerprints: from geometry to topology
• Polynomial-lemniscates, trees and braids
• Statistics on Hilbert's 16th problem
• The arc length and topology of a random lemniscate
• Topological classification of Morse functions and generalisations of Hilbert's 16-th problem

Cited in

(10)

• Constructing separable Arnold snakes of Morse polynomials
• Some recent results on the geometry of complex polynomials: the Gauss-Lucas theorem, polynomial lemniscates, shape analysis, and conformal equivalence
• Geometric combinatorics of polynomials. I: The case of a single polynomial
• scientific article; zbMATH DE number 592831 (Why is no real title available?)
• The arc length and topology of a random lemniscate
• Polynomial lemniscates and their fingerprints: from geometry to topology
• On the geometry of random lemniscates
• Inradius of random lemniscates
• On the number of components of random polynomial lemniscates
• On the shapes of rational lemniscates

This page was built for publication: The lemniscate tree of a random polynomial

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2027745)