zbMATH — the first resource for mathematics

On integer Chebyshev polynomials. (English) Zbl 0911.11033
The study of \(d_n=\text{LCM} (1,2,\ldots,n)\) in number theory motivates a closer look at polynomials \(P_k\in{\mathbb Z}_k[X]\) (integer coefficients, degree \(\leq k\)) and constants \(C_k\) defined by \[ | | P_k| | =\min_{P\in{\mathbb Z}_k[X]} | | P| | _{\infty},\quad C_k=-\tfrac 1k\log | | P_k| | _{\infty} \] (\(| | \cdot| | _{\infty}\) the Chebyshev norm on the interval \([0,1]\)). The polynomials \(P_k\) are called integer Bernstein polynomials on \([0,1]\) or polynomials of minimal diophantic deviation from zero.
Using MAPLE and two theoretical lemmas, the authors give a table of factorizations of \(P_k\) for \(k\leq 70\). In the polynomial \(P_{70}\) a factor \[ \begin{split} A_8(x)=4921 X^{10}-24605 X^9+53804 X^8-67586 X^7+ 53866 X^6\\ - 28388 X^5+9995 X^4-2317 X^3+338 X^2-28 X+1\end{split} \] shows up, leading to an improvement on the lower bound of \(C=\lim_{k\rightarrow\infty} C_k\) given in the literature and to the solution of an open problem in P. Borwein and T. Erdélyi [The integer Chebyshev problem, Math. Comput. 65, 661-681 (1996; Zbl 0859.11044)].

11J54 Small fractional parts of polynomials and generalizations
41A10 Approximation by polynomials
41-04 Software, source code, etc. for problems pertaining to approximations and expansions
11-04 Software, source code, etc. for problems pertaining to number theory
Full Text: DOI
[1] Peter Borwein and Tamás Erdélyi, The integer Chebyshev problem, Math. Comp. 65 (1996), no. 214, 661 – 681. · Zbl 0859.11044
[2] Emiliano Aparicio Bernardo, On the approximation of functions by polynomials with integer coefficients, Proc. Eighth Annual Reunion of Spanish Mathematicians (Santiago, 1967) Publ. Inst. ”Jorge Juan” Mat., Madrid, 1969, pp. 21 – 33 (Spanish).
[3] Emiliano Aparicio Bernardo, On the asymptotic structure of the polynomials of minimal Diophantic deviation from zero, J. Approx. Theory 55 (1988), no. 3, 270 – 278. · Zbl 0663.41008
[4] Valérie Flammang, Sur le diamètre transfini entier d’un intervalle à extrémités rationnelles, Ann. Inst. Fourier (Grenoble) 45 (1995), no. 3, 779 – 793 (French, with English and French summaries). · Zbl 0826.41009
[5] V. Flammang, G. Rhin, and C. J. Smyth, The integer transfinite diameter of intervals and totally real algebraic integers, Tech. Report MS-95-033, Department of Mathematics and Statistics, University of Edinburgh, 1995. · Zbl 0892.11033
[6] Naoyoshi Kanamaru, Takao Nishizeki, and Tetsuo Asano, Efficient enumeration of grid points in a convex polygon and its application to integer programming, Internat. J. Comput. Geom. Appl. 4 (1994), no. 1, 69 – 85. · Zbl 0807.90086
[7] Hugh L. Montgomery, Ten lectures on the interface between analytic number theory and harmonic analysis, CBMS Regional Conference Series in Mathematics, vol. 84, Published for the Conference Board of the Mathematical Sciences, Washington, DC; by the American Mathematical Society, Providence, RI, 1994. · Zbl 0814.11001
[8] M. Nair, On Chebyshev-type inequalities for primes, Amer. Math. Monthly 89 (1982), no. 2, 126 – 129. · Zbl 0494.10004
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.