Open AccessDissertation
The integer chebyshev problem: computational explorations
Alan Meichsner
- 01 Jan 2009
TL;DR: The integer Chebyshev polynomials of degree at most n with integer coefficients having minimal supremum norm on a domain D and then analyzing the limiting value of the nth root of the supremum norms is called the integer Chebyhev constant for D as discussed by the authors.
read more
Abstract: The integer Chebyshev problem deals with finding polynomials of degree at most n with integer coefficients having minimal supremum norm on a domain D and then analyzing the nth root behavior of the supremum norm of these polynomials as n tends to infinity The limiting value of the nth root of the supremum norms is called the integer Chebyshev constant for D and the polynomials are called nth integer Chebyshev polynomials on D The problem has a long history on the intervals [0; 1] and [0; 1=4], and although the structure of such polynomials is not well understood, it is known that certain critical polynomials must be factors of relatively high multiplicity Progress is made here by extending the method of Wu to include all known critical polynomials on these intervals which results in an increase in the best known lower bounds for the degree to which many of these critical polynomials must divide an nth integer Chebyshev polynomial For the unrestricted case on [0; 1], this results in an increase for all known critical polynomials On the interval [0; 1=4], it results in an increase for all known nonlinear critical polynomials Towards finding nth integer Chebyshev polynomials, each stage of the method of Habsieger and Salvy is improved and nth integer Chebyshev polynomials for the unit interval are given for all n less than or equal to 145 As a final result in the single variable case, the upper bound on the integer Chebyshev constant of the unit interval is decreased to 1/236482727 The move to the bivariate case on the unit square is then made in two ways and the basic results, which include existence of the limits, initial bounds on the integer Chebyshev constants, symmetry conditions, and the method of computation are extended For the computation of nth integer Chebyshev polynomials on the unit square, a new application of the integer relation algorithm PSLQ is used to take advantage of symmetry
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
A new view on HJLS and PSLQ: sums and projections of lattices
Jingwei Chen,Damien Stehlé,Gilles Villard +2 more
- 26 Jun 2013
TL;DR: This work provides a new interpretation of HJLS and PSLQ, view them as special cases of algorithms that compute the intersection between a lattice and a vector subspace, and extracts the first algorithm for manipulating finitely generated additive subgroups of a euclidean space.
On the absolute length of polynomials having all zeros in a sector
TL;DR: An upper bound for the integer transfinite diameter of the interval [0,1] from the lower bound of the absolute length of theabsolute length of totally positive algebraic integers is obtained.
10
Generalized Gorshkov–Wirsing Polynomials and the Integer Chebyshev Problem
TL;DR: In this article, it is shown how to construct generalized Gorshkov-Wirsing polynomials on any interval [a, b], with. And an extensive search for generalized Gorskhkov-wirsing polynomials is carried out for a large family of polynomial families.
On the Euler scale and the μEuclidean integer relation algorithm
TL;DR: In this paper, the equal-tempered 10-tone scale e n/10 (n=0,±1,±2, …), using the Euler number e=2.71828, as a pseudo-octave is shown to approximate well the prime number harmonics 2, 3, 5, and 11.
Métodos numérico-simbólicos para calcular soluciones liouvillianas de ecuaciones diferenciales lineales
Alberto Llorente
- 01 Jan 2014
TL;DR: In this paper, van der Hoeven et al. introduce a set of metodos numerico-simbolicos to determine whether a sistema explicitable de ecuación diferenciales diferentciales de orden superior sobre las funciones racionales complejas, dado simbolicamente, admite soluciones liouvillianas no nulas.
References
Factoring Polynomials with Rational Coefficients
TL;DR: This paper presents a polynomial-time algorithm to solve the following problem: given a non-zeroPolynomial fe Q(X) in one variable with rational coefficients, find the decomposition of f into irreducible factors in Q (X).
Ideals, Varieties, and Algorithms
TL;DR: In the Groebner package, the most commonly used commands are NormalForm, for doing the division algorithm, and Basis, for computing a Groebners basis as mentioned in this paper. But these commands require a large number of variables.
•Book
A Course in Computational Algebraic Number Theory
Henri Cohen
- 01 Jan 1993
TL;DR: The first seven chapters guide readers to the heart of current research in computational algebraic number theory, including recent algorithms for computing class groups and units, as well as elliptic curve computations, while the last three chapters survey factoring and primality testing methods.
3.3K
Factoring polynomials with rational coeficients
H.W. Lenstra,A.K. Lenstra,L. Lovfiasz +2 more
- 01 Jan 1982
TL;DR: In this paper, a polynomial-time algorithm was proposed to decompose a primitive polynomials into irreducible factors in Z(X) if the greatest common divisor of its coefficients is 1.
•Book
Ideals, Varieties, and Algorithms: An Introduction to Computational Algebraic Geometry and Commutative Algebra
David A. Cox,John Little,Donal O’Shea +2 more
- 01 Jan 1992
TL;DR: Schenzel as mentioned in this paper provides a good introduction to algebraic geometry and commutative algebra with a strong perspective toward practical and computational aspects, including the elimination theorem, the extension theorem, closure theorem, and the Nullstellensatz.
2.9K