Related papers: Persistence probability of random weyl polynomial
The author in [7] was proved the generalized remainder and quotient theorems of polynomial in one indeterminate where the divisor is complete factorization to linear factors. In this paper we give the formula for the generalized remainder…
We consider sufficiently spread-out Bernoulli percolation in dimensions ${d>6}$. We present a short and simple proof of the up-to-constants estimate for the one-arm probability in both the full-space and half-space settings. These results…
We study the asymptotic distribution of roots of Lommel polynomials as polynomials of the order with a variable and purely imaginary argument. The roots are complex and accumulate on certain curves in the complex plane. We prove existence…
Polynomial system solving has seen major progress in both theory and practice over the past decade. A landmark achievement was addressing Smale's 17th problem, establishing average-case polynomial-time algorithms for computing approximate…
Density Ratio Estimation has attracted attention from the machine learning community due to its ability to compare the underlying distributions of two datasets. However, in some applications, we want to compare distributions of random…
In 2013, Marcus, Spielman, and Srivastava resolved the famous Kadison-Singer conjecture. It states that for $n$ independent random vectors $v_1,\cdots, v_n$ that have expected squared norm bounded by $\epsilon$ and are in the isotropic…
In this note we put forward a conjecture on the average optimal length for bipartite matching with a finite number of elements where the different lengths are independent one from the others and have an exponential distribution.
The exact computation of permanent for high-dimensional tensors is a hard problem. Having in mind the applications of permanents in other fields, providing an algorithm for the approximation of tensor permanents is an attractive subject. In…
We prove a multivariate strengthening of Brenti's result that every root of the Eulerian polynomial of type $B$ is real. Our proof combines a refinement of the descent statistic for signed permutations with the notion of real stability-a…
We survey results on Chebyshev polynomials centered around the work of H. Widom. In particular, we discuss asymptotics of the polynomials and their norms and general upper and lower bounds for the norms. Several open problems are also…
We study tail probabilities via some Gaussian approximations. Our results make refinements to large deviation theory. The proof builds on classical results by Bahadur and Rao. Binomial distributions and their tail probabilities are…
The prevailing statistical approach to analyzing persistence diagrams is concerned with filtering out topological noise. In this paper, we adopt a different viewpoint and aim at estimating the actual distribution of a random persistence…
The aim of this paper is to establish some new results on the absolute continuity and the convergence in total variation for a sequence of d-dimensional vectors whose components belong to a finite sum of Wiener chaoses. First we show that…
We obtain first decay rates of probabilities of tails of multivariate polynomials built on independent random variables with heavy tails. Then we derive stable limit theorems for nonconventional sums of the form $\sum_{Nt\geq n\geq…
A polynomial is called self-reciprocal (or palindromic) if the sequence of its coefficients is palindromic. In this paper we enumerate self-reciprocal irreducible monic polynomials over a finite field with prescribed leading coefficients.…
The P-Eulerian polynomial counts the linear extensions of a labeled partially ordered set, P, by their number of descents. It is known that the P-Eulerian polynomials are real-rooted for various classes of posets P. The purpose of this…
We consider random polynomials with independent identically distributed coefficients with a fixed law. Assuming the Riemann hypothesis for Dedekind zeta functions, we prove that such polynomials are irreducible and their Galois groups…
In this paper, we consider sequences of polynomials that satisfy differential--difference recurrences. Our interest is motivated by the fact that polynomials satisfying such recurrences frequently appear as generating polynomials of integer…
The permanent versus determinant conjecture is a major problem in complexity theory that is equivalent to the separation of the complexity classes VP_{ws} and VNP. Mulmuley and Sohoni (SIAM J. Comput., 2001) suggested to study a…
We study the persistence probability of a centered stationary Gaussian process on $\mathbb{Z}$ or $\mathbb{R}$, that is, its probability to remain positive for a long time. We describe the delicate interplay between this probability and the…