Littlewood polynomials, spectral-null codes, and equipowerful partitions
DOI10.1090/mcom/3612zbMath1473.11062arXiv1912.03491OpenAlexW3104201944MaRDI QIDQ5856749
Stan Wagon, Rob Pratt, Shahar Golan, Joe P. Buhler
Publication date: 29 March 2021
Published in: Mathematics of Computation (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1912.03491
integer linear programmingLittlewood polynomialsantenna arrayspectral-null codeequal power sum partitionmultigrade identity
Linear codes (general theory) (94B05) Polynomials in number theory (11C08) Polynomials in real and complex fields: location of zeros (algebraic theorems) (12D10) Special sequences and polynomials (11B83)
Uses Software
Cites Work
- Unnamed Item
- The Prouhet-Tarry-Escott problem revisited
- Equal moments division of a set
- On a problem of Byrnes concerning polynomials with restricted coefficients
- Automatic Sequences
- Asymptotically exact bounds on the size of high-order spectral-null codes
- Polynomials with Height 1 and Prescribed Vanishing at 1
- On a problem of Byrnes concerning polynomials with restricted coefficients, II
- High-order spectral-null codes-constructions and bounds
- Rudin-Shapiro-Like Sequences With Maximum Asymptotic Merit Factor
- Littlewood polynomials with high order zeros
This page was built for publication: Littlewood polynomials, spectral-null codes, and equipowerful partitions