arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1912.03491math.NT
收藏

Littlewood多项式、谱码和等幂分拆

Littlewood Polynomials, Spectral-Null Codes, and Equipowerful Partitions

Joe Buhler, Shahar Golan, Rob Pratt, Stan Wagon

摘要:

令$[n]$表示$\{0,1, ... , n-1\}$。如果$a_i$对于$i \in [n]$是$\pm 1$,对于$i \ge n$是$a_i = 0$,则多项式$f(x) = \sum a_i x^i$是长度为$n$的Littlewood多项式(LP)。这样的LP被称为具有阶$m$,如果它可被$(x-1)^m$整除。找到$m$阶LP的长度的集合$L_m$的问题等价于找到$m$阶谱空码的长度,以及找到$n$,使得$[n]$允许分成两个子集,其第一$m$矩相等。扩展Boyd等人的技术和结果,我们完全确定了$L_7$和$L_8$,并证明192是$L_9$的最小元素。我们的主要工具是使用整数线性规划仔细有针对性的搜索(既找到LP,并反驳他们的存在,为特定的$n$和$m$),和一个意想不到的新概念(出现了观察到的对称性的LP),我们称之为“再生对”,产生无限的算术级数在$L_m$。我们证明了对于$m \le$ 8,只要存在一个长度为$n$,阶为$m$的LP,就存在一个长度为$n$,阶为$m$的对称LP(分别为~反对称),如果m是偶数(分别为~奇数)。

英文摘要:

Let $[n]$ denote $\{0,1, ... , n-1\}$. A polynomial $f(x) = \sum a_i x^i$ is a Littlewood polynomial (LP) of length $n$ if the $a_i$ are $\pm 1$ for $i \in [n]$, and $a_i = 0$ for $i \ge n$. Such an LP is said to have order $m$ if it is divisible by $(x-1)^m$. The problem of finding the set $L_m$ of lengths of LPs of order $m$ is equivalent to finding the lengths of spectral-null codes of order $m$, and to finding $n$ such that $[n]$ admits a partition into two subsets whose first $m$ moments are equal. Extending the techniques and results of Boyd and others, we completely determine $L_7$ and $L_8$ and prove that 192 is the smallest element of $L_9$. Our primary tools are the use of carefully targeted searches using integer linear programming (both to find LPs and to disprove their existence for specific $n$ and $m$), and an unexpected new concept (that arose out of observed symmetry properties of LPs) that we call "regenerative pairs," which produce infinite arithmetic progressions in $L_m$. We prove that for $m \le$ 8, whenever there is an LP of length $n$ and order $m$, there is one of length $n$ and order $m$ that is symmetric (resp.~antisymmetric) if m is even (resp.~odd).

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

↑