English
Related papers

Related papers: Root Statistics of Random Polynomials with Bounded…

200 papers

We consider the roots of uniformly chosen complex and real reciprocal polynomials of degree $N$ whose Mahler measure is bounded by a constant. After a change of variables this reduces to a generalization of Ginibre's complex and real…

Classical Analysis and ODEs · Mathematics 2019-12-02 Christopher D. Sinclair , Maxim L. Yattselev

We study Laurent polynomials in any number of variables that are sums of at most $k$ monomials. We first show that the Mahler measure of such a polynomial is at least $h/2^{k-2}$, where $h$ is the height of the polynomial. Next, restricting…

Number Theory · Mathematics 2017-01-24 Edward Dobrowolski , Chris Smyth

In this paper, we consider the relationship between the Mahler measure of a polynomial and its separation. In 1964, Mahler proved that if $f(x) \in \mathbb{Z}[x]$ is separable of degree $n$, then $\operatorname{sep}(f) \gg_n M(f)^{-(n-1)}$.…

Number Theory · Mathematics 2025-09-10 Greg Knapp , Chi Hoi Yip

Mahler's measure is generalized to create the class of {\it multiplicative distance functions}. These functions measure the complexity of polynomials based on the location of their zeros in the complex plane. Following work of S.-J. Chern…

Number Theory · Mathematics 2014-02-26 Christopher D. Sinclair

Our aim is to explain instances in which the value of the logarithmic Mahler measure of a polynomial can be written in an unexpectedly neat manner. To this end we examine polynomials defining rational curves, which allows their zero-locus…

Number Theory · Mathematics 2007-06-11 Sam Vandervelde

Theorem 1 is a formula expressing the mean number of real roots of a random multihomogeneous system of polynomial equations as a multiple of the mean absolute value of the determinant of a random matrix. Theorem 2 derives closed form…

Probability · Mathematics 2007-05-23 Andrew McLennan

The algorithms of Pan (1995) and(2002) approximate the roots of a complex univariate polynomial in nearly optimal arithmetic and Boolean time but require precision of computing that exceeds the degree of the polynomial. This causes…

Symbolic Computation · Computer Science 2016-11-10 Victor Y. Pan , Elias P. Tsigaridas , Vitaly Zaderman , Liang Zhao

For certain polynomials we relate the number of roots inside the unit circle with the index of a non-degenerate isolated umbilic point on a real analytic surface in Euclidean 3-space. In particular, for $N>0$ we prove that for a certain…

Differential Geometry · Mathematics 2023-09-07 Brendan Guilfoyle , Wilhelm Klingenberg

Univariate polynomial root-finding is a classical subject, still important for modern computing. Frequently one seeks just the real roots of a polynomial with real coefficients. They can be approximated at a low computational cost if the…

Symbolic Computation · Computer Science 2017-04-14 Victor Y. Pan , Liang Zhao

The Mahler measure of a polynomial $P$ in $n$ variables is defined as the mean of $\log|P|$ over the $n$-dimensional torus. For certain polynomials with integer coefficients in two variables the Mahler measure is known to be related to…

Number Theory · Mathematics 2015-03-23 Hubert Bornhorn

Univariate polynomial root-finding is a classical subject, still important for modern computing. Frequently one seeks just the real roots of a real coefficient polynomial. They can be approximated at a low computational cost if the…

Numerical Analysis · Mathematics 2015-06-16 Victor Y. Pan , Liang Zhao

Mahler's problem asks for the largest possible value of the Mahler measure, normalized by the $L_2$ norm, of a polynomial with $\pm1$ coefficients and large degree. We establish a new record value in this problem exceeding $0.95$ by…

Number Theory · Mathematics 2025-10-24 Michael J. Mossinghoff

Root separation bounds play an important role as a complexity measure in understanding the behaviour of various algorithms in computational algebra, e.g., root isolation algorithms. A classic result in the univariate setting is the…

Symbolic Computation · Computer Science 2020-05-19 Vikram Sharma

We improve Mahler's lower bound for the Mahler measure in terms of the discriminant and degree for a specific class of polynomials: complex monic polynomials of degree $d\geq 2$ such that all roots with modulus greater than some fixed value…

Number Theory · Mathematics 2023-09-19 Murray Child , Martin Widmer

Let f:=(f^1,\...,f^n) be a sparse random polynomial system. This means that each f^i has fixed support (list of possibly non-zero coefficients) and each coefficient has a Gaussian probability distribution of arbitrary variance. We express…

Numerical Analysis · Mathematics 2025-10-20 Gregorio Malajovich , J. Maurice Rojas

Littlewood polynomials are polynomials with each of their coefficients in {-1,1}. A sequence of Littlewood polynomials that satisfies a remarkable flatness property on the unit circle of the complex plane is given by the Rudin-Shapiro…

Complex Variables · Mathematics 2014-06-10 Tamas Erdelyi

In this work, we are dealing with some properties relating the zeros of a polynomial and its Mahler measure. We provide estimates on the number of real zeros of a polynomial, lower bounds on the distance between the zeros of a polynomial…

Number Theory · Mathematics 2021-03-15 Myrial Ounaies , Georges Rhin , Jean Marc Sac-Épée

The Mahler measure of a nonzero $n$-variable polynomial $P$ is the integral of $\log|P|$ on the unit $n$-torus. A result of Boyd and Lawton says that the Mahler measure of a multivariate polynomial is the limit of Mahler measures of…

Number Theory · Mathematics 2019-08-15 Zahraa Issa , Matilde Lalín

We present an exact formula for the Mahler measure of an infinite family of polynomials with arbitrarily many variables. The formula is obtained by manipulating the integral defining the Mahler measure using certain transformations,…

Number Theory · Mathematics 2025-01-14 Siva Sankar Nair

Let F:=(f_1,...,f_n) be a random polynomial system with fixed n-tuple of supports. Our main result is an upper bound on the probability that the condition number of f in a region U is larger than 1/epsilon. The bound depends on an integral…

Numerical Analysis · Mathematics 2025-10-20 Gregorio Malajovich , J. Maurice Rojas
‹ Prev 1 2 3 10 Next ›