Crab Research
返回结果列表
组合数学

非负分圆多项式乘积与面数为平方数的骰子

Nonnegative Cyclotomic Products and Square-Sided Dice

工作论文 · Zenodo首次公开 修订

形式化是机器可检查的证明。证明助手的逻辑核心称为内核;它仅从已列明的基本逻辑原则出发,检查全部承重定理,不额外假设未经证明的定理。这称为 Kernel-Only 验证。

研究概述

分圆多项式以本原单位根为零点。本文完整刻画由两个互异素数的幂确定的一个乘积族何时系数全非负,解决 Fiore–Nasr–Stone 关于面数为平方数的骰子重新标号的猜想 5.7,并证明乘子的最优次数下界及全部等号情形。文中数学结果已有公开的 Lean 4 证明,使用通常的整系数多项式。

原始公开问题

Fiore–Nasr–Stone 猜想 5.7:面数为平方数的骰子

Evelyn Fiore, George D. Nasr and Cooper Stone: Dice Relabeling Using Square-Sided Dice — Conjecture 5.7: coefficient positivity of the cyclotomic product Q_01 in square-sided dice relabeling.

原文摘要(英文)

We determine when a family of products of cyclotomic polynomials has nonnegative coefficients. For distinct primes p, q and positive integers a, b, the product Phi_(q^b)(x)^2 Phi_(p^a q^b)(x) is nonnegative coefficientwise precisely when a = 1, or when a = 2, p = 2 and q is congruent to 1 modulo 4. The case a = 2, b = 1 proves a conjecture of Fiore, Nasr and Stone arising from relabeling dice with square numbers of sides. The proof uses the classical decomposition of nonnegative vanishing sums of roots of unity whose orders have two prime divisors. For products with nonnegative coefficients, this gives a sharp degree bound on integer multipliers whose coefficient sums are not divisible by a prescribed prime, together with all equality cases. At the exceptional boundary, a positive factorization gives the admissible dice polynomial directly. We also obtain a uniform obstruction for higher powers of the first cyclotomic factor.

公开摘要来源

cyclotomic polynomialsnonnegative coefficientsdice relabelingvanishing sums of roots of unitypolynomial multipliers

数学审核

Kernel-Only

主要结论拥有公开的内核检查证明包,并已审核其与论文的对应关系。这与外部同行评审是不同的验证。

审核标准
返回结果列表
返回 数学