On a problem of Byrnes concerning polynomials with restricted coefficients, II

Author:
David W. Boyd

Journal:
Math. Comp. **71** (2002), 1205-1217

MSC (2000):
Primary 11C08, 12D10; Secondary 94B05, 11Y99

DOI:
https://doi.org/10.1090/S0025-5718-01-01360-6

Published electronically:
May 11, 2001

MathSciNet review:
1898751

Full-text PDF

Abstract | References | Similar Articles | Additional Information

As in the earlier paper with this title, we consider a question of Byrnes concerning the minimal length of a polynomial with all coefficients in which has a zero of a given order at . In that paper we showed that for all and showed that the extremal polynomials for were those conjectured by Byrnes, but for that rather than . A polynomial with was exhibited for , but it was not shown there that this extremal was unique. Here we show that the extremal is unique. In the previous paper, we showed that is one of the 7 values or . Here we prove that without determining all extremal polynomials. We also make some progress toward determining . As in the previous paper, we use a combination of number theoretic ideas and combinatorial computation. The main point is that if is a primitive th root of unity where is a prime, then the condition that all coefficients of be in , together with the requirement that be divisible by puts severe restrictions on the possible values for the cyclotomic integer .

**[BM]**P. Borwein and M. Mossinghoff,*Polynomials with height**and prescribed vanishing at*, Experiment. Math.**9**(2000), 425-433. CMP**2001:04****[Bo]**D.W. Boyd,*On a problem of Byrnes concerning polynomials with restricted coefficients*, Math. Comp.**66**(1997), 1697-1703. MR**98a:11033****[By]**J.S. Byrnes,*Problems on polynomials with restricted coefficients arising from questions in antenna array theory*, Recent Advances in Fourier Analysis and Its Applications (J.S. Byrnes and J.F. Byrnes, eds.), Kluwer Academic Publishers, Dordrecht, 1990, pp. 677-678.**[E]**H.M. Edwards,*Fermat's Last Theorem. A genetic introduction to algebraic number theory*, Springer-Verlag, New York, 1977. MR**83b:12001a****[FL]**G. Freiman and S. Litsyn,*Asymptotically exact bounds on the size of high-order spectral-null codes*, IEEE Trans. Inform. Theory**45**(1999), 1798-1807. MR**2000k:94060****[LN]**R. Lidl and H. Niederreiter,*Finite Fields*, Addison-Wesley, Reading, 1983. MR**86c:11106****[NW]**A. Nijenhuis, and H.S. Wilf,*Combinatorial Algorithms*, Academic Press, Orlando, 1978. MR**80a:68076****[RSV]**R.M. Roth, P.H. Siegel, and A. Vardy,*High-order spectral-null codes: Constructions and bounds*, IEEE Trans. Inform. Theory**35**(1989), 463-472.**[R]**R.M. Roth,*Spectral-null codes and null spaces of Hadamard submatrices*, Designs, Codes and Cryptography**9**(1996), 177-191. MR**98e:94034****[S]**V. Skachek,*Coding for Spectral-Null Constraints*, Research Thesis, Master of Science in Computer Science, Technion, Israel Institute of Technology, November 1997 (Hebrew).

Retrieve articles in *Mathematics of Computation*
with MSC (2000):
11C08,
12D10,
94B05,
11Y99

Retrieve articles in all journals with MSC (2000): 11C08, 12D10, 94B05, 11Y99

Additional Information

**David W. Boyd**

Affiliation:
Department of Mathematics, University of British Columbia, Vancouver, B.C., Canada V6T 1Z2

Email:
boyd@math.ubc.ca

DOI:
https://doi.org/10.1090/S0025-5718-01-01360-6

Keywords:
Polynomial,
zero,
spectral-null code

Received by editor(s):
September 8, 1997

Received by editor(s) in revised form:
September 19, 2000

Published electronically:
May 11, 2001

Additional Notes:
This research was supported by a grant from NSERC

Article copyright:
© Copyright 2001
American Mathematical Society