Related papers: Central Binomial Tail Bounds
The boundedness tests for the number of compact integral manifolds of autonomous ordinary differential systems, of autonomous total differential systems, of linear systems of partial differential equations, of Pfaff systems of equations,…
We obtain a new bound on certain double sums of multiplicative characters improving the range of several previous results. This improvement comes from new bounds on the number of collinear triples in finite fields, which is a classical…
We obtain a new upper bound for binary sums with multiplicative characters over variables belong to some sets, having small additive doubling.
We present several results concerning the semiclassical limit of the time dependent Schr\"odinger equation with potentials whose regularity doesn't guarantee the uniqueness of the underlying classical flow. Different topologies for the…
We reconsider the valuation of barrier options by means of binomial trees from a "forward looking" prospective rather than the more conventional "backward induction" one used by standard approaches. This reformulation allows us to write…
We give new improvements to the Chudnovsky-Chudnovsky method that provides upper bounds on the bilinear complexity of multiplication in extensions of finite fields through interpolation on algebraic curves. Our approach features three…
An approach is proposed for bounding the number of zeros that solutions of linear differential systems with polynomial coefficients may have. A bound is obtained in a special case which improves upon currently existing.
A sharp version of the Central Limit Theorem for linear combinations of iterates of an inner function is proved. The authors previously showed this result assuming a suboptimal condition on the coefficients of the linear combination. Here…
A Central Limit Theorem is proved for linear random fields when sums are taken over finite disjoint union of rectangles. The approach does not rely upon the use of Beveridge Nelson decomposition and the conditions needed are similar to…
This work considers new entropy-based proofs of some known, or otherwise refined, combinatorial bounds for bipartite graphs. These include upper bounds on the number of the independent sets, lower bounds on the minimal number of colors in…
We prove a central limit theorem for a sequence of random variables whose means are ambiguous and vary in an unstructured way. Their joint distribution is described by a set of measures. The limit is (not the normal distribution and is)…
This research focuses on analyzing the depth of generalized binomial edge ideals. We extend the notion of $d$-compatible map for the pairs of a complete graph and an arbitrary graph, and using it, we give a combinatorial lower bound for the…
When searching for Calabi.Yau differential equations, often different formulas for the coefficients give the same differential equation. The coefficients are usually sums (simple, double or triple) of products of binomial coefficients. This…
We explore the asymptotic convergence and nonasymptotic maximal inequalities of supermartingales and backward submartingales in the space of positive semidefinite matrices. These are natural matrix analogs of scalar nonnegative…
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…
Let $X$ be a $n\times p$ matrix with coherence $\mu(X)=\max_{j\neq j'} |X_j^tX_{j'}|$. We present a simplified and improved study of the quasi-isometry property for most submatrices of $X$ obtained by uniform column sampling. Our results…
Young's integral inequality is complemented with an upper bound to the remainder. The new inequality turns out to be equivalent to Young's inequality, and the cases in which the equality holds become particularly transparent in the new…
We prove hybrid subconvexity bounds for a wide class of twisted L-functions $L(s,f\times \chi)$ at the central point, including a new instance of the Weyl subconvexity bound.
Binomial versions of the Andrews-Gordon-Bressoud identities are given.
Gaps (or spacings) between consecutive eigenvalues are a central topic in random matrix theory. The goal of this paper is to study the tail distribution of these gaps in various random matrix models. We give the first repulsion bound for…