Kirkland与Šmigoc的III型实现猜想
The Type III realisation conjecture of Kirkland and Šmigoc
浏览论文内容
中文总结 AI 辅助
本文针对0<α≤1的参数范围，证明了Kirkland与Šmigoc提出的III型边界多项式的随机实现猜想，通过组合方法完成约化与等号推导，单独处理α=1端点并解释α=0的退化性。
中文摘要 AI 辅助
Kirkland和Šmigoc构造了一类随机矩阵，用于实现Karpelevič区域中的III型边界多项式，并提出猜想：反之，此类多项式的每一个随机实现都必须来自他们的构造。我们针对全非零参数范围0<α≤1，以及n阶真正III型简化Ito多项式f_α(x)=x^y(x^q-(1-α))^d-α^d（其中n=qd+y），证明了该猜想。对于0<α<1，证明首先利用Dmitriev-Dynkin边界定理将每个实现约化为双移位循环标准型，后续论证为有限组合性：Coates系数公式与加权Turán定理的等号情形，迫使后向边关联的q-环分裂为d个总权重相等的完全多部类；随后圆弧 telescoping论证将此加性等式转化为Kirkland与Šmigoc要求的乘积条件。端点α=1单独处理。我们还解释了闭端点α=0为何退化：向该端点的字面扩展不成立，因为具有闭q-环和瞬态状态的可约实现不一定包含全局n-环。
英文摘要
Kirkland and Šmigoc constructed a family of stochastic matrices realising the Type III boundary polynomials in the Karpelevič region and conjectured that, conversely, every stochastic realisation of such a polynomial must come from their construction. We prove this conjecture for the full nonzero parameter range $0<α\le1$, for genuine Type III reduced Ito polynomials of order $n$, $f_α(x)=x^y(x^q-(1-α))^d-α^d$, where $n=qd+y$. For $0<α<1$, the proof first reduces every realisation to a two-shift cyclic normal form using the Dmitriev--Dynkin boundary theorem. The remaining argument is finite and combinatorial: Coates' coefficient formula and the equality case of a weighted Turán theorem force the $q$-cycles associated with the backward edges to split into $d$ complete multipartite classes of equal total weight. A circular-arc telescoping argument then converts this additive equality into the product condition required by Kirkland and Šmigoc. The endpoint $α=1$ is treated separately. We also explain why the closed endpoint $α=0$ is degenerate: the literal extension to this endpoint fails, because reducible realisations with closed $q$-cycles and transient states need not contain the global $n$-cycle.
