随机多项式的双纽线树
The lemniscate tree of a random polynomial
摘要:
对于每个通用复多项式$p(z)$,存在对$|p(z)|$的图的拓扑型进行编码的标记二叉树(这里称为“双纽树”)。双纽线树的分支结构由配置确定(即,在平面中的排列)的奇异分量的那些水平集$|p(z)|=t$通过临界点。在本文中,我们解决的问题“有多少分支出现在一个典型的双纽线树?“我们首先回答这个问题的双纽树均匀抽样的组合类和第二双纽树所产生的随机多项式i.i.d.零.从一个更一般的角度来看,这些结果采取了第一步概率治疗(在一个专门的设置)阿诺德的程序枚举代数莫尔斯函数。
英文摘要:
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.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。