English
Related papers

Related papers: On zeros of multilinear polynomials

200 papers

We compute the maximum number of rational points at which a homogeneous polynomial can vanish on a weighted projective space over a finite field, provided that the first weight is equal to one. This solves a conjecture by Aubry, Castryck,…

Algebraic Geometry · Mathematics 2025-07-31 Jade Nardi , Rodrigo San-José

We study an infinite class of sequences of sparse polynomials that have binomial coefficients both as exponents and as coefficients. This generalizes a sequence of sparse polynomials which arises in a natural way as graph theoretic…

Classical Analysis and ODEs · Mathematics 2020-08-05 Karl Dilcher , Maciej Ulas

We prove a new lower bound for the Mahler measure of a polynomial in one and in several variables that depends on the complex coefficients, and the number of monomials. In one variable our result generalizes a classical inequality of…

Number Theory · Mathematics 2022-03-22 Shabnam Akhtari , Jeffrey D. Vaaler

We study the conditional distribution of zeros of a Gaussian system of random polynomials (and more generally, holomorphic sections), given that the polynomials or sections vanish at a point p (or a fixed finite set of points). The…

Complex Variables · Mathematics 2013-01-24 Bernard Shiffman , Steve Zelditch , Qi Zhong

Sequences of discrete random variables are studied whose probability generating functions are zero-free in a sector of the complex plane around the positive real axis. Sharp bounds on the cumulants of all orders are stated, leading to…

Probability · Mathematics 2023-12-04 Nils Heerten , Holger Sambale , Christoph Thäle

We establish a discrepancy theorem for signed measures, with a given positive part, which are supported on an arbitrary convex curve. As a main application, we obtain a result concerning the distribution of zeros of polynomials orthogonal…

Complex Variables · Mathematics 2013-07-23 V. V. Andrievskii , I. E. Pritsker , R. S. Varga

Let L be the zero set of a nonconstant monic polynomial with complex coefficients. In the context of constructive mathematics without countable choice, it may not be possible to construct an element of L. In this paper we introduce a notion…

Logic · Mathematics 2015-10-06 Robert Lubarsky , Fred Richman

We give a conditional proof of the Uniform Boundedness Conjecture of Morton and Silverman in the case of polynomials over number fields, assuming a standard conjecture in arithmetic geometry. Our technique simultaneously yields a dynamical…

Number Theory · Mathematics 2025-12-23 Nicole R. Looper

A quantum mechanical search procedure to determine the real zeros of a polynomial is introduced. It is based on the construction of a spin observable whose eigenvalues coincide with the zeros of the polynomial. Subsequent quantum mechanical…

Quantum Physics · Physics 2009-11-10 Stefan Weigert

We present an effective criterion for determining whether a (augmented) vertically parametrized polynomial system admits multiple positive zeros for some choice of parameter values. Our method builds on previous algorithms from chemical…

Algebraic Geometry · Mathematics 2025-12-11 Carles Checa , Elisenda Feliu

We establish sharp estimates that adapt the polynomial method to arbitrary varieties. These include a partitioning theorem, estimates on polynomials vanishing on fixed sets and bounds for the number of connected components of real algebraic…

Algebraic Geometry · Mathematics 2020-06-15 Miguel N. Walsh

We give an elementary introduction to some recent polyhedral techniques for understanding and solving systems of multivariate polynomial equations. We provide numerous concrete examples and illustrations, and assume no background in…

Algebraic Geometry · Mathematics 2025-10-20 J. Maurice Rojas

We provide upper bounds for the size of subsets of finite fields lacking the polynomial progression $$ x, x+y, ..., x+(m-1)y, x+y^m, ..., x+y^{m+k-1}.$$ These are the first known upper bounds in the polynomial Szemer\'{e}di theorem for the…

Number Theory · Mathematics 2020-01-16 Borys Kuca

In this study we find height bounds for polynomial rings over integral domains. We apply nonstandard methods and hence our constants will be ineffective. Then we find height bounds in the polynomial ring over algebraic numbers to test…

Logic · Mathematics 2014-05-27 Haydar Göral

We study a conjecture called "linear rank conjecture" recently raised in (Tsang et al., FOCS'13), which asserts that if many linear constraints are required to lower the degree of a GF(2) polynomial, then the Fourier sparsity (i.e. number…

Computational Complexity · Computer Science 2015-08-11 Hing Yin Tsang , Ning Xie , Shengyu Zhang

This paper deals with properties of the algebraic variety defined as the set of zeros of a "deficient" sequence of multivariate polynomials. We consider two types of varieties: ideal-theoretic complete intersections and absolutely…

Algebraic Geometry · Mathematics 2022-08-19 Nardo Giménez , Guillermo Matera , Mariana Pérez , Melina Privitelli

We give formulas for the multiplicity of any affine isolated zero of a generic polynomial system of n equations in n unknowns with prescribed sets of monomials. First, we consider sets of supports such that the origin is an isolated root of…

Algebraic Geometry · Mathematics 2018-08-16 María Isabel Herrero , Gabriela Jeronimo , Juan Sabia

We study the probability distribution of the number of common zeros of a system of $m$ random $n$-variate polynomials over a finite commutative ring $R$. We compute the expected number of common zeros of a system of polynomials over $R$.…

Probability · Mathematics 2026-01-27 Ritik Jain

Consider a system of polynomials in many variables over the ring of integers of a number field $K$. We prove an asymptotic formula for the number of integral zeros of this system in homogeneously expanding boxes. As a consequence, any…

Number Theory · Mathematics 2019-02-20 Christopher Frei , Manfred Madritsch

We give a bound for the number of real solutions to systems of n polynomials in n variables, where the monomials appearing in different polynomials are distinct. This bound is smaller than the fewnomial bound if this structure of the…

Algebraic Geometry · Mathematics 2009-05-29 Frederic Bihan , Frank Sottile