English
Related papers

Related papers: Local tail bounds for polynomials on the discrete …

200 papers

This work prepares new probability bounds for sums of random, independent, Hermitian tensors. These probability bounds characterize large-deviation behavior of the extreme eigenvalue of the sums of random tensors. We extend Lapalace…

Probability · Mathematics 2021-01-01 Shih Yu Chang

Bounds for the expected return probability of the delayed random walk on finite clusters of an invariant percolation on transitive unimodular graphs are derived. They are particularly suited for the case of critical Bernoulli percolation…

Probability · Mathematics 2017-06-20 Florian Sobieczky

We consider multilinear Littlewood polynomials, polynomials in $n$ variables in which a specified set of monomials $U$ have $\pm 1$ coefficients, and all other coefficients are $0$. We provide upper and lower bounds (which are close for $U$…

Combinatorics · Mathematics 2021-07-21 Gil Kalai , Leonard J. Schulman

We study the bias of random bounded-degree polynomials over odd prime fields and show that, with probability exponentially close to 1, such polynomials have exponentially small bias. This also yields an exponential tail bound on the weight…

Discrete Mathematics · Computer Science 2018-06-20 Paul Beame , Shayan Oveis Gharan , Xin Yang

It is known that random monic integral polynomials of bounded degree $d$ and integral coefficients distributed uniformly and independently in $[-H,H]$ are irreducible over $\mathbb{Z}$ with probability tending to $1$ as $H\to \infty$. In…

Number Theory · Mathematics 2021-07-21 Huy Tuan Pham , Max Wenqiang Xu

In this note, we prove a tight lower bound on the joint entropy of $n$ unbiased Bernoulli random variables which are $n/2$-wise independent. For general $k$-wise independence, we give new lower bounds by adapting Navon and Samorodnitsky's…

Discrete Mathematics · Computer Science 2018-01-16 Amey Bhangale , Aditya Potukuchi

This paper addresses the problem of deciding the lower-boundedness of an arbitrary real polynomial p in n variables.

Optimization and Control · Mathematics 2025-12-01 Nguyen Hong Duc , Vu Trung Hieu

How low can the joint entropy of $n$ $d$-wise independent (for $d\ge2$) discrete random variables be, subject to given constraints on the individual distributions (say, no value may be taken by a variable with probability greater than $p$,…

Discrete Mathematics · Computer Science 2022-04-05 Dmytro Gavinsky , Pavel Pudlák

We establish the first tight bound on the lower tail probability of the half-space KPZ equation with Neumann boundary parameter $A = -1/2$ and narrow-wedge initial data. When the tail depth is of order $T^{2/3}$, the lower bound…

Probability · Mathematics 2021-09-28 Yujin H. Kim

Classes of polynomial differential equations of degree n are considered. An explicit upper bound on the size of the coefficients are given which implies that each equation in the class has exactly n complex periodic solutions. In most of…

Classical Analysis and ODEs · Mathematics 2009-04-20 M. A. M. Alwash

We establish a weighted $L^p$ norm estimate for the Bergman projection for a class of pseudoconvex domains. We obtain an upper bound for the weighted $L^p$ norm when the domain is, for example, a bounded smooth strictly pseudoconvex domain,…

Complex Variables · Mathematics 2023-10-18 Zhenghui Huo , Nathan A. Wagner , Brett D. Wick

We obtain a necessary and sufficient condition on a polynomial $P(t_1,t_2)$ for the $\ell^{p}$ boundedness of the discrete double Hilbert transforms associated with $P(t)$ for $1 < p < \infty$. The proof is based on the multi-parameter…

Classical Analysis and ODEs · Mathematics 2025-10-01 Joonil Kim , Hoyoung Song

We prove a lower bound on the canonical height associated to polynomials over number fields evaluated at points with infinite forward orbit. The lower bound depends only on the degree of the polynomial, the degree of the number field, and…

Number Theory · Mathematics 2017-09-27 Nicole Looper

We study Brownian motion in a drifted Brownian potential in the subexponential regime. We prove that the annealed probability of deviating below the almost sure speed has a polynomial rate of decay and compute the exponent in this power…

Probability · Mathematics 2007-05-23 Marina Talet

The goal of this paper is to prove that a random polynomial with i.i.d. random coefficients taking values uniformly in $\{1,\ldots, 210\}$ is irreducible with probability tending to $1$ as the degree tends to infinity. Moreover, we prove…

Number Theory · Mathematics 2020-03-18 Lior Bary-Soroker , Gady Kozma

A regularity lemma for polynomials provides a decomposition in terms of a bounded number of approximately independent polynomials. Such regularity lemmas play an important role in numerous results, yet suffer from the familiar shortcoming…

Combinatorics · Mathematics 2026-05-26 Guy Moshkovitz , Dora Woodruff

We show that the probability that a multilinear polynomial $f$ of independent random variables exceeds its mean by $\lambda$ is at most $e^{-\lambda^2 / (R^q Var(f))}$ for sufficiently small $\lambda$, where $R$ is an absolute constant.…

Probability · Mathematics 2012-06-11 Warren Schudy , Maxim Sviridenko

Let $(\xi_i)_{i=1,...,n}$ be a sequence of independent and symmetric random variables. We consider the upper bounds on tail probabilities of self-normalized deviations $$ \mathbf{P} \Big( \max_{1\leq k \leq n} \sum_{i=1}^{k} |\xi_i|\big/…

Probability · Mathematics 2017-05-05 Xiequan Fan

Around 2008, Schramm conjectured that the critical probabilities for Bernoulli bond percolation satisfy the following continuity property: If $(G_n)_{n\geq 1}$ is a sequence of transitive graphs converging locally to a transitive graph $G$…

Probability · Mathematics 2019-07-29 Tom Hutchcroft

We establish upper and lower bounds with matching leading terms for tails of weighted sums of two-sided exponential random variables. This extends Janson's recent results for one-sided exponentials.

Probability · Mathematics 2025-01-28 Jiawei Li , Tomasz Tkocz