English
Related papers

Related papers: Random Sparse Polynomial Systems

200 papers

Roots of random polynomials have been studied exclusively in both analysis and probability for a long time. A famous result by Ibragimov and Maslova, generalizing earlier fundamental works of Kac and Erdos-Offord, showed that the…

Probability · Mathematics 2015-05-05 Hoi Nguyen , Oanh Nguyen , Van Vu

We consider the problem of interpolating a sparse multivariate polynomial over a finite field, represented with a black box. Building on the algorithm of Ben-Or and Tiwari for interpolating polynomials over rings with characteristic zero,…

Symbolic Computation · Computer Science 2020-02-11 Qiao-Long Huang

We study sums of independent random variables that take values $0$, $1/2$, or $1$. We show that the probability mass function of the sum splits into two interleaved parts: one supported on the integers and the other supported on the…

Probability · Mathematics 2026-03-11 Mark Broadie , Ina Petkova

Let $S=\{p_1,\dots,p_s\}$ be a finite non-empty set of distinct prime numbers, let $f\in \mathbb{Z}[X]$ be a polynomial of degree $n\ge 1$, and let $S'\subseteq S$ be the subset of all $p\in S$ such that $f$ has a root in $\mathbb{Z}_p$.…

Number Theory · Mathematics 2019-07-22 Maurizio Moreschi

Consider a sparse polynomial in several variables given explicitly as a sum of non-zero terms with coefficients in an effective field. In this paper, we present several algorithms for factoring such polynomials and related tasks (such as…

Symbolic Computation · Computer Science 2025-02-26 Alexander Demin , Joris van der Hoeven

We consider the problem of finding the isolated common roots of a set of polynomial functions defining a zero-dimensional ideal I in a ring R of polynomials over C. We propose a general algebraic framework to find the solutions and to…

Algebraic Geometry · Mathematics 2017-11-15 Simon Telen , Bernard Mourrain , Marc Van Barel

Compressed sensing and its extensions have recently triggered interest in randomized signal acquisition. A key finding is that random measurements provide sparse signal reconstruction guarantees for efficient and stable algorithms with a…

Information Theory · Computer Science 2014-07-08 Felix Krahmer , Holger Rauhut

It is an open question whether the fractional parts of nonlinear polynomials at integers have the same fine-scale statistics as a Poisson point process. Most results towards an affirmative answer have so far been restricted to almost sure…

Number Theory · Mathematics 2019-02-20 Jens Marklof , Nadav Yesha

If f is a polynomial with integer coefficients and q is an integer, we may regard f as a map from Z/qZ to Z/qZ. We show that the distribution of the (normalized) spacings between consecutive elements in the image of these maps becomes…

Number Theory · Mathematics 2007-05-23 P. Kurlberg

This paper extends earlier work on the distribution in the complex plane of the roots of random polynomials. In this paper, the random polynomials are generalized to random finite sums of given "basis" functions. The basis functions are…

Probability · Mathematics 2016-08-04 Robert J. Vanderbei

We exhibit a probabilistic symbolic algorithm for solving zero-dimensional sparse systems. Our algorithm combines a symbolic homotopy procedure, based on a flat deformation of a certain morphism of affine varieties, with the polyhedral…

Classical Analysis and ODEs · Mathematics 2007-05-23 Gabriela Jeronimo , Guillermo Matera , Pablo Solerno , Ariel Waissbein

When P indistinguishable balls are randomly distributed among L distinguishable boxes, and considering the dense system in which P much greater than L, our natural intuition tells us that the box with the average number of balls has the…

Physics and Society · Physics 2016-06-14 Oded Kafri

It is common in stability analysis to linearize a system and investigate the spectrum of the Jacobian matrix. This approach faces the challenge of determining the matrix spectrum when the coefficients depend on parameters or when the…

Dynamical Systems · Mathematics 2025-03-17 Ziyad AlSharawi , Jose S. Cánovas , Sadok Kallel

In this paper we investigate the uniform distribution properties of polynomials in many variables and bounded degree over a fixed finite field F of prime order. Our main result is that a polynomial P : F^n -> F is poorly-distributed only if…

Combinatorics · Mathematics 2007-11-21 Ben Green , Terence Tao

We consider the problem of efficient integration of an n-variate polynomial with respect to the Gaussian measure in R^n and related problems of complex integration and optimization of a polynomial on the unit sphere. We identify a class of…

Optimization and Control · Mathematics 2007-05-23 Alexander Barvinok

In this work, we consider the Biot problem with uncertain poroelastic coefficients. The uncertainty is modelled using a finite set of parameters with prescribed probability distribution. We present the variational formulation of the…

Numerical Analysis · Mathematics 2020-02-19 Michele Botti , Daniele A. Di Pietro , Olivier Le Maître , Pierre Sochala

We consider the zeroes of a random Gaussian Entire Function f and show that their basins under the gradient flow of the random potential U partition the complex plane into domains of equal area. We find three characteristic exponents 1,…

Complex Variables · Mathematics 2007-05-23 Fedor Nazarov , Mikhail Sodin , Alexander Volberg

The distribution of genetic polymorphisms in a population contains information about the mutation rate and the strength of natural selection at a locus. Here, we show that the Poisson Random Field (PRF) method of population-genetic…

Populations and Evolution · Quantitative Biology 2007-07-18 Michael M Desai , Joshua B. Plotkin

Let $K$ be a convex body in $\R^d$, let $j\in\{1, ..., d-1\}$, and let $\varrho$ be a positive and continuous probability density function with respect to the $(d-1)$-dimensional Hausdorff measure on the boundary $\partial K$ of $K$. Denote…

Metric Geometry · Mathematics 2014-10-07 Károly J. Böröczky , Ferenc Fodor , Daniel Hug

A degree-$d$ polynomial $p$ in $n$ variables over a field $\F$ is {\em equidistributed} if it takes on each of its $|\F|$ values close to equally often, and {\em biased} otherwise. We say that $p$ has a {\em low rank} if it can be expressed…

Combinatorics · Mathematics 2008-07-02 Tali Kaufman , Shachar Lovett