Related papers: A Numerical Algorithm for Zero Counting. II: Dista…

Systems of orthogonal polynomials whose recurrence coefficients tend to infinity are considered. A summability condition is imposed on the coefficients and the consequences for the measure of orthogonality are discussed. Also discussed are…

The classical problem of counting the number of real zeros of a real polynomial was solved a long time ago by Sturm. The analogous problem of counting the number of zeros that a polynomial has on the unit circle is, however, still an open…

The null space condition for $\ell_1$ minimization in compressed sensing is a necessary and sufficient condition on the sensing matrices under which a sparse signal can be uniquely recovered from the observation data via $\ell_1$…

This paper demonstrates some connections between the coefficients of a Taylor series $f(z)=\ds\sum_{n=0}^\infty a_n z^n$ and singularities of the function. There are many known results of this type, for example, counting the number of poles…

This paper aims to justify the use of statistical mechanics tools in situations where the system is out of equilibrium and jammed. Specifically, we derive a Boltzmann equation for a jammed granular system and show that the Boltzmann's…

Systems of germs of sets in infinite-dimensional spaces are introduced and studied. Such a system corresponds to a local zero-set of an ideal of the ring of analytic functions of infinite number of variables. Conversely, this system of…

Given a system of linear equations $\ell_i(x)=\beta_i$ in an $n$-vector $x$ of 0-1 variables, we compute the expectation of $\exp\left\{- \sum_i \gamma_i \left(\ell_i(x) - \beta_i\right)^2\right\}$, where $x$ is a vector of independent…

Zeros of many ensembles of polynomials with random coefficients are asymptotically equidistributed near the unit circumference. We give quantitative estimates for such equidistribution in terms of the expected discrepancy and expected…

Gradient-based algorithms have shown great promise in solving large (two-player) zero-sum games. However, their success has been mostly confined to the low-precision regime since the number of iterations grows polynomially in $1/\epsilon$,…

We define tests of boolean functions which distinguish between linear (or quadratic) polynomials, and functions which are very far, in an appropriate sense, from these polynomials. The tests have optimal or nearly optimal trade-offs between…

We present an infinite family of recursive formulas that count binary integer partitions satisfying natural divisibility conditions and show that these counts are interrelated via partial sums. Moreover, we interpret the partitions we study…

The so-called {\it zero number diminishing property} (or {\it zero number argument}) is a powerful tool in qualitative studies of one dimensional parabolic equations, which says that, under the zero- or non-zero-Dirichlet boundary…

In the framework of a real Hilbert space, we address the problem of finding the zeros of the sum of a maximally monotone operator $A$ and a cocoercive operator $B$. We study the asymptotic behaviour of the trajectories generated by a second…

Consider a random sum $\eta_1 v_1 + ... + \eta_n v_n$, where $\eta_1,...,\eta_n$ are i.i.d. random signs and $v_1,...,v_n$ are integers. The Littlewood-Offord problem asks to maximize concentration probabilities such as $\P(\eta_1 v_1 + ...…

We compare Stochastic and Worst-case condition numbers and loss of precision for general computational problems. We show an upper bound for the ratio of Worst-case condition number to the Stochastic condition number of order O(sqrt m). We…

The use of combinatorial optimization algorithms has contributed substantially to the major progress that has occurred in recent years in the understanding of the physics of disordered systems, such as the random-field Ising model. While…

An ideal of a local polynomial ring can be described by calculating a standard basis with respect to a local monomial ordering. However standard basis algorithms are not numerically stable. Instead we can describe the ideal numerically by…

We deal with the random combinatorial structures called assemblies. By weakening the logarithmic condition which assures regularity of the number of components of a given order, we extend the notion of logarithmic assemblies. Using the…

We introduce the smoothed analysis of algorithms, which is a hybrid of the worst-case and average-case analysis of algorithms. In smoothed analysis, we measure the maximum over inputs of the expected performance of an algorithm under small…

Lower bounds are given for the number of non-real zeros of a second order linear differential polynomial with constant coefficients in a real entire function with finitely many non-real zeros.