非负分圆多项式乘积与面数为平方数的骰子
Nonnegative Cyclotomic Products and Square-Sided Dice
研究概述
分圆多项式以本原单位根为零点。完整刻画一个由两个素数的幂确定的多项式乘积族何时系数非负,解决面数为平方数的骰子重新标号中的一个猜想,并给出多项式乘子的最优次数下界及全部等号情形。
原文摘要(英文)
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.
数学审核
稿件已完成内部审核,当前公开版本尚未完成完整形式化。
审核标准