arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1802.07474math.DSmath.AGmath.COmath.CV
收藏

多项式映射的模空间及其不动点乘子:II。算法的改进与单中心多项式

The Moduli Space of Polynomial Maps and Their Fixed-Point Multipliers: II. Improvement to the Algorithm and Monic Centered Polynomials

Toshi Sugiyama

摘要:

本文研究了一元复复变数多项式族$\mathrm{MC}_d$,并研究了$\mathrm{MC}_d$到其不动点乘子的无序集合的映射$\widehatΦ_d:\mathrm{MC}_d\to \widetildeΛ_d \subset \mathbb{C}^d / \mathfrak{S}_d$.我们给出了一个明确的公式,用于计算每个纤维$\widehatΦ_d^{-1}\left(\barλ\right)$的每个$\barλ \in \widetildeΛ_d$的元素的数量,除了当纤维$\widehatΦ_d^{-1}\left(\barλ\right)$包含具有多个不动点的多项式。这个公式不是递归的,是我们以前结果[T. Sugiyama,多项式映射的模空间及其不动点乘子。322(2017),132- 185],其给出了具有一些归纳过程的相当长的算法。

英文摘要:

We consider the family $\mathrm{MC}_d$ of monic centered polynomials of one complex variable with degree $d \geq 2$, and study the map $\widehatΦ_d:\mathrm{MC}_d\to \widetildeΛ_d \subset \mathbb{C}^d / \mathfrak{S}_d$ which maps each $f \in \mathrm{MC}_d$ to its unordered collection of fixed-point multipliers. We give an explicit formula for counting the number of elements of each fiber $\widehatΦ_d^{-1}\left(\barλ\right)$ for every $\barλ \in \widetildeΛ_d$ except when the fiber $\widehatΦ_d^{-1}\left(\barλ\right)$ contains polynomials having multiple fixed points. This formula is not a recursive one, and is a drastic improvement of our previous result [T. Sugiyama, The moduli space of polynomial maps and their fixed-point multipliers. Adv. Math. 322 (2017), 132--185] which gave a rather long algorithm with some induction processes.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑