2 citations · 11 across the 27 of their papers we have counts for
7 papers · 2 filters
Polynomials with integer coefficients and their zeros
Igor E. Pritsker
We study several related problems on polynomials with integer coefficients. This includes the integer Chebyshev problem, and the Schur problems on means of algebraic numbers. We al…
Distribution of algebraic numbers
Igor E. Pritsker
Schur studied limits of the arithmetic means of zeros for polynomials of degree with integer coefficients and simple zeros in the closed unit disk. If the leading coeffic…
Means of algebraic numbers in the unit disk
Igor E. Pritsker
Schur studied limits of the arithmetic means of zeros for polynomials of degree with integer coefficients and simple zeros in the closed unit disk. If the leading coeffic…
The multivariate integer Chebyshev problem
P. B. Borwein, I. E. Pritsker
The multivariate integer Chebyshev problem is to find polynomials with integer coefficients that minimize the supremum norm over a compact set in $\C^d.$ We study this problem on g…
An areal analog of Mahler's measure
Igor E. Pritsker
We consider a version of height on polynomial spaces defined by the integral over the normalized area measure on the unit disk. This natural analog of Mahler's measure arises in co…
Monic integer Chebyshev problem
P. B. Borwein, C. G. Pinner, I. E. Pritsker
We study the problem of minimizing the supremum norm by monic polynomials with integer coefficients. Let ${\M}_n({\Z})$ denote the monic polynomials of degree with integer coef…