Related papers: Local tail bounds for polynomials on the discrete …
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 study local boundedness for subsolutions of nonlinear nonuniformly elliptic equations whose prototype is given by $\nabla \cdot (\lambda |\nabla u|^{p-2}\nabla u)=0$, where the variable coefficient $0\leq\lambda$ and its inverse…
Let us consider subcritical Bernoulli percolation on a connected, transitive, infinite and locally finite graph. In this paper, we propose a new (and short) proof of the exponential decay property for the volume of clusters. We do not rely…
We derive various bounds for the $L_p$ distance of polynomials on the hypercube from Walsh tail spaces, extending some of Oleszkiewicz's results (2017) for Rademacher sums.
We determine necessary and sufficient conditions for unicritical polynomials to be dynamically irreducible over finite fields. This result extends the results of Boston-Jones and Hamblen-Jones-Madhu regarding the dynamical irreducibility of…
We address some questions concerning indecomposable polynomials and their behaviour under specialization. For instance we give a bound on a prime $p$ for the reduction modulo $p$ of an indecomposable polynomial $P(x)\in \Zz[x]$ to remain…
We provide large deviations estimates for the upper tail of the number of triangles in scale-free inhomogeneous random graphs where the degrees have power law tails with index $-\alpha, \alpha \in (1,2)$. We show that upper tail…
The probability that the sum of independent, centered, identically distributed, heavy-tailed random variables achieves a very large value is asymptotically equal to the probability that there exists a single summand equalling that value. We…
For random polynomials with i.i.d. (independent and identically distribu-ted) zeros following any common probability distribution $\mu$ with support contained in the unit circle, the empirical measures of the zeros of their first and higher…
We conjecture formulae of the colored superpolynomials for a class of twist knots $K_p$ where p denotes the number of full twists. The validity of the formulae is checked by applying differentials and taking special limits. Using the…
The best known upper estimates for the constants of the Hardy--Littlewood inequality for $m$-linear forms on $\ell_{p}$ spaces are of the form $\left(\sqrt{2}\right) ^{m-1}.$ We present better estimates which depend on $p$ and $m$. An…
In this note we present an algorithm to obtain a uniform lower bound on Hausdorff dimension of the stationary measure of an affine iterated function scheme with similarities, the best known example of which is Bernoulli convolution. The…
We investigate locality of the supercritical regime for Bernoulli percolation on transitive graphs with polynomial growth, by which we mean the following. Take a transitive graph of polynomial growth $\mathscr{G}$ satisfying…
We obtain upper bounds for the first Dirichlet eigenvalue of a tube around a complex submanifold $P$ of $CP^n$ which depends only on the radius of the tube, the degrees of the polynomials defining $P$ and the first eigenvalue of some model…
The paper studies upper bounds for the total variation distance between two polynomials of a special form in random vectors satisfying the Doeblin-type condition. Our approach is based on the recent results concerning Nikolskii--Besov-type…
In general, obtaining the exact steady-state distribution of queue lengths is not feasible. Therefore, we establish bounds for the tail probabilities of queue lengths. Specifically, we examine queueing systems under Heavy-Traffic (HT)…
We derive exponential bounds for tail of distribution for natural, i.e. under ordinary logarithm, normalized sums of arrays of random variables, not necessarily independent.
We define two new families of polynomials that generalize permanents and prove upper and lower bounds on their determinantal complexities comparable to the known bounds for permanents. One of these families is obtained by replacing…
We generalize the shadow codes of Cherubini and Micheli to include basic polynomials having arbitrary degree, and show that restricting basic polynomials to have degree one or less can result in improved lower bounds on the minimum distance…
Let I_1,...,I_n be independent but not necessarily identically distributed Bernoulli random variables, and let X_n=\sum_{j=1}^nI_j. For \nu in a bounded region, a local central limit theorem expansion of P(X_n=EX_n+\nu) is developed to any…