相关论文: Random Sparse Polynomial Systems

We consider a space of sparse Boolean matrices of size $n \times n$, which have finite co-rank over $GF(2)$ with high probability. In particular, the probability such a matrix has full rank, and is thus invertible, is a positive constant…

We build a new probability measure on closed space and plane polygons. The key construction is a map, given by Knutson and Hausmann using the Hopf map on quaternions, from the complex Stiefel manifold of 2-frames in n-space to the space of…

One of the biggest open problems in computational algebra is the design of efficient algorithms for Gr{\"o}bner basis computations that take into account the sparsity of the input polynomials. We can perform such computations in the case of…

We consider the statistical properties of the gravitational field F in an infinite one-dimensional homogeneous Poisson distribution of particles, using an exponential cut-off of the pair interaction to control and study the divergences…

We consider the problem of uniform sampling of points on an algebraic variety. Specifically, we develop a randomized algorithm that, given a small set of multivariate polynomials over a sufficiently large finite field, produces a common…

Let $f:\{-1,1\}^n$ be a polynomial with at most $s$ non-zero real coefficients. We give an algorithm for exactly reconstructing f given random examples from the uniform distribution on $\{-1,1\}^n$ that runs in time polynomial in $n$ and…

Let $K$ be a convex body in $\mathbb{R}^n$ and $f : \partial K \rightarrow \mathbb{R}_+$ a continuous, strictly positive function with $\int\limits_{\partial K} f(x) d \mu_{\partial K}(x) = 1$. We give an upper bound for the approximation…

Let $\{f(t): t\in T\}$ be a smooth Gaussian random field over a parameter space $T$, where $T$ may be a subset of Euclidean space or, more generally, a Riemannian manifold. For any local maximum of $f(t)$ located at $t_0$ in the interior of…

This paper primarily concerns the variance estimate of zeros of systems of random holomorphic sections associated with a sequence of smooth Hermitian holomorphic line bundles on a compact Kahler manifold X. The probability measures taken…

We review and study some of the properties of smooth Gaussian random fields defined on a homogeneous space, under the assumption that the probability distribution is invariant under the isometry group of the space. We first give an…

Let $\mathcal{R} = \mathbb{K}[x_1, \dots, x_n]$ be a multivariate polynomial ring over a field $\mathbb{K}$ of characteristic 0. Consider $n$ algebraically independent elements $g_1, \dots, g_n$ in $\mathcal{R}$. Let $\mathcal{S}$ denote…

We study global distribution of zeros for a wide range of ensembles of random polynomials. Two main directions are related to almost sure limits of the zero counting measures, and to quantitative results on the expected number of zeros in…

Let K be F_q((T)), or more generally any field of characteristic p equipped with a valuation having a finite residue field of q elements. Then a polynomial f(x) in K[x] having k+1 nonzero coefficients has at most q^k distinct zeros in K. We…

The expected number of zeros of a random real polynomial of degree $N$ asymptotically equals $\frac{2}{\pi}\log N$. On the other hand, the average fraction of real zeros of a random trigonometric polynomial of increasing degree $N$…

While most existing sparse recovery results allow only minimal structure within the measurement scheme, many practical problems possess significant structure. To address this gap, we present a framework for structured measurements that are…

Suppose f is a real univariate polynomial of degree D with exactly 4 monomial terms. We present an algorithm, with complexity polynomial in log D on average (relative to the stable log-uniform measure), for counting the number of real roots…

We provide an elementary geometric derivation of the Kac integral formula for the expected number of real zeros of a random polynomial with independent standard normally distributed coefficients. We show that the expected number of real…

We study the expected number of real zeros for random linear combinations of orthogonal polynomials. It is well known that Kac polynomials, spanned by monomials with i.i.d. Gaussian coefficients, have only $(2/\pi + o(1))\log{n}$ expected…

Consider a polynomial of large degree n whose coefficients are independent, identically distributed, nondegenerate random variables having zero mean and finite moments of all orders. We show that such a polynomial has exactly k real zeros…

We consider the sensitivity of real zeros of structured polynomial systems to perturbations of their coefficients. In particular, we provide explicit estimates for condition numbers of structured random real polynomial systems, and extend…