Related papers: Random Sparse Polynomial Systems

We study constrained selection sets of random closed sets defined on a non-atomic probability space. Given a random interval $Y=[y_L,y_U]$ and scalar constraints on the expectation or the median of admissible selections, we characterize the…

Many statistics of roots of random polynomials have been studied in the literature, but not much is known on the concentration aspect. In this note we present a systematic study of this question, aiming towards nearly optimal bounds to some…

Invariants are a set of properties over program attributes that are expected to be true during the execution of a program. Since developing those invariants manually can be costly and challenging, there are a myriad of approaches that…

For a $t$-nomial $f(x) = \sum_{i = 1}^t c_i x^{a_i} \in \mathbb{F}_q[x]$, we show that the number of distinct, nonzero roots of $f$ is bounded above by $2 (q-1)^{1-\varepsilon} C^\varepsilon$, where $\varepsilon = 1/(t-1)$ and $C$ is the…

The problem central to sparse recovery and compressive sensing is that of stable sparse recovery: we want a distribution of matrices A in R^{m\times n} such that, for any x \in R^n and with probability at least 2/3 over A, there is an…

We investigate random complex dynamics of rational or polynomial maps on the Riemann sphere. We show that regarding random complex dynamics of polynomials, generically, the chaos of the averaged system disappears at any point in the Riemann…

This paper focuses on the equidimensional decomposition of affine varieties defined by sparse polynomial systems. For generic systems with fixed supports, we give combinatorial conditions for the existence of positive dimensional components…

Random fields are useful mathematical tools for representing natural phenomena with complex dependence structures in space and/or time. In particular, the Gaussian random field is commonly used due to its attractive properties and…

Expansive polynomials (whose roots are greater than 1 in modulus) often arise in dynamical systems and other computational problems. This paper examines the expansivity gap (the gap between 1 and the smallest modulus of the roots) of these…

In many applications, one is faced with an inverse problem, where the known signal depends in a bilinear way on two unknown input vectors. Often at least one of the input vectors is assumed to be sparse, i.e., to have only few non-zero…

Consider a system F of n polynomials in n variables, with a total of n+k distinct exponent vectors, over any local field L. We discuss conjecturally tight bounds on the maximal number of non-degenerate roots F can have over L, with all…

This article addresses an equidistribution problem concerning the zeros of systems of random holomorphic sections of positive line bundles on compact K\"{a}hler manifolds and random polynomials on $\mathbb{C}^{m}$ in the setting of the…

Let $\mathcal{P}$ be the set of the primes. We consider a class of random multiplicative functions $f$ supported on the squarefree integers, such that $\{f(p)\}_{p\in\mathcal{P}}$ form a sequence of $\pm1$ valued independent random…

Suppose $k,p\!\in\!\mathbb{N}$ with $p$ prime and $f\!\in\!\mathbb{Z}[x]$ is a univariate polynomial with degree $d$ and all coefficients having absolute value less than $p^k$. We give a Las Vegas randomized algorithm that computes the…

We consider a random variable expressed as the Euclidean distance between an arbitrary point and a random variable uniformly distributed in a closed and bounded set of a three-dimensional Euclidean space. Four cases are considered for this…

We study various statistical properties of real roots of three different classes of random polynomials which recently attracted a vivid interest in the context of probability theory and quantum chaos. We first focus on gap probabilities on…

We prove a structural result for degree-$d$ polynomials. In particular, we show that any degree-$d$ polynomial, $p$ can be approximated by another polynomial, $p_0$, which can be decomposed as some function of polynomials $q_1,...,q_m$ with…

This paper introduces the notion of probabilistic zero bounds for random polynomials. It presents new results regarding the probabilistic bounds of random polynomials whose coefficients are independently and identically distributed as…

We generalize some previous results on random polynomials in several complex variables. A standard setting is to consider random polynomials $H_n(z):=\sum_{j=1}^{m_n} a_jp_j(z)$ that are linear combinations of basis polynomials $\{p_j\}$…

A difficult problem in the theory of random tensors is to calculate the expectation values of polynomials in the tensor entries, even in the large N limit and in a Gaussian distribution. Here we address this issue, focusing on a family of…