English
Related papers

Related papers: Central Binomial Tail Bounds

200 papers

We define a class of multivariate Laurent polynomials closely related to Chebyshev polynomials, and prove the simple but somewhat surprising (in view of the fact that the signs of the coefficients of the Chebyshev polynomials themselves…

Classical Analysis and ODEs · Mathematics 2007-05-23 Igor Rivin

We give a complete characterization of graphs whose binomial edge ideal is licci. An important tool is a new general upper bound for the regularity of binomial edge ideals.

Commutative Algebra · Mathematics 2019-10-10 Viviana Ene , Giancarlo Rinaldo , Naoki Terai

We find the exact values for constants in bilateral Calderon-Stein-Weiss inequalities between tail (Marcinkiewicz) norm and weak Lebesgue (Lorentz) norm. Possible applications: Functional Analysis (for instance, interpolation of operators),…

Functional Analysis · Mathematics 2012-10-18 E. Ostrovsky , L. Sirota

Lower bounds for some explicit decision problems over the complex numbers are given.

Numerical Analysis · Mathematics 2025-10-20 Gregorio Malajovich

We study the Central Limit Theorem (CLT) in the so-called mixed (anisotropic) Lebesgue-Riesz spaces and tail behavior of normed sums of centered random independent variables (vectors) with values in these spaces.

Probability · Mathematics 2013-08-27 E. Ostrovsky , L. Sirota

Let $(S_0,S_1,...)$ be a supermartingale relative to a nondecreasing sequence of $\sigma$-algebras $H_{\le0},H_{\le1},...$, with $S_0\le0$ almost surely (a.s.) and differences $X_i:=S_i-S_{i-1}$. Suppose that $X_i\le d$ and $\mathsf…

Probability · Mathematics 2007-05-23 Iosif Pinelis

We give a bound for the number of real solutions to systems of n polynomials in n variables, where the monomials appearing in different polynomials are distinct. This bound is smaller than the fewnomial bound if this structure of the…

Algebraic Geometry · Mathematics 2009-05-29 Frederic Bihan , Frank Sottile

Second order linear non-autonomous differential equations with negative stiffness are considered. Using Chetaev-like (Lyapunov-like) functions, necessary (sufficient) conditions are found for the solutions to be bounded for all initial…

Classical Analysis and ODEs · Mathematics 2007-05-23 C. A. Terrero-Escalante

Backoff algorithms are used in many distributed systems where multiple devices contend for a shared resource. For the classic balls-into-bins problem, the number of singletons -- those bins with a single ball -- is important to the analysis…

Distributed, Parallel, and Cluster Computing · Computer Science 2022-02-01 Qian M. Zhou , Alice Calvert , Maxwell Young

This paper is the Part II of a serious work about T product tensors focusing at establishing new probability bounds for sums of random, independent, T product tensors. These probability bounds characterize large deviation behavior of the…

Probability · Mathematics 2021-12-10 Shih Yu Chang , Yimin Wei

We analyze, mainly using bifurcation methods, an elliptic superlinear problem in one-dimension with periodic boundary conditions. One of the main novelties is that we follow for the first time a bifurcation approach, relying on a…

Classical Analysis and ODEs · Mathematics 2025-04-15 Eduardo Muñoz-Hernández , Juan Carlos Sampedro , Andrea Tellini

We derive upper bounds for probabilities of the form $P(g(\mathbf{X})\geq t)$ using the southwest boundary (recently introduced in our previous work) $\partial_{\mathrm{SW}} Q(g^{-1}[t,\infty))$, where $Q$ is a reflection to the first…

Probability · Mathematics 2026-04-27 Stephen Jordan Harrison

We investigate the coefficients of the highest and lowest terms (also called the head and the tail) of the colored Jones polynomial and show that they stabilize for alternating links and for adequate links. To do this we apply techniques…

Geometric Topology · Mathematics 2014-10-01 Cody Armond

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

A central limit theorem for binary tree is numerically examined. Two types of central limit theorem for higher-order branches are formulated. A topological structure of a binary tree is expressed by a binary sequence, and the…

Data Analysis, Statistics and Probability · Physics 2013-04-10 Ken Yamamoto , Yoshihiro Yamazaki

We derive asymptotic formulas for central extended binomial coefficients, which are generalizations of binomial coefficients. To do so, we relate the exact distribution of the sum of independent discrete uniform random variables to the…

Probability · Mathematics 2016-08-05 Steffen Eger

We give an upper bound for the dealternating number of a closed 3-braid. As applications, we determine the dealternating numbers, the alternation numbers and the Turaev genera of some closed positive 3-braids. We also show that there exist…

Geometric Topology · Mathematics 2008-12-10 Tetsuya Abe , Kengo Kishimoto

Known Bernstein-type upper bounds on the tail probabilities for sums of independent zero-mean sub-exponential random variables are improved in several ways at once. The new upper bounds have a certain optimality property.

Probability · Mathematics 2022-08-15 Iosif Pinelis

We prove a Chernoff-like large deviation bound on the sum of non-independent random variables that have the following dependence structure. The variables $Y_1,...,Y_r$ are arbitrary Boolean functions of independent random variables…

Discrete Mathematics · Computer Science 2022-03-30 Dmytro Gavinsky , Shachar Lovett , Michael Saks , Srikanth Srinivasan

This paper generalizes the bordered-algebraic knot invariant introduced in an earlier paper, giving an invariant now with more algebraic structure. It also introduces signs to define these invariants with integral coefficients. We describe…

Geometric Topology · Mathematics 2019-02-14 Peter S. Ozsvath , Zoltan Szabo