Abstract
This paper investigates the minimal degree of polynomialsf∈R[x] that take exactly two values on a given range of integers {0,...n}. We show that thegap, defined asn-deg(f), isO(n 548). The maximal gap forn≤128 is 3. As an application, we obtain a bound on the Fourier degree of symmetric Boolean functions.
Similar content being viewed by others
References
R. L. Graham, D. E. Knuth, andO. Patashnik:Concrete Mathematics, Addison-Wesley, New York, 1989.
C. J. Mozzochi: On the difference between consecutive primes,J. Number Theory,24 (1986), 181–187.
N. Nisan andM. Szegedy: On the degree of Boolean functions as real polynomials,STOC, 1992, Victoria, 462–474.
D. Singmaster: Repeated binomial coefficients and Fibonacci numbers,The Fibonacci Quarterly,13 (1975), 295–298.
B. M. Stewart:Theory of Numbers, 2nd edition, The Macmillan Co., New York, 1965.
C. A. Tovey: Multiple occurrences of binomial coefficients,The Fibonacci Quarterly,23 (1985), 356–358.