Related papers: A Study Of Some Generalized Central Sets Theorem A…

For random combinatorial optimization problems, there has been much progress in establishing laws of large numbers and computing limiting constants for the optimal value of various problems. However, there has not been as much success in…

Kakutani's fixed point theorem is a generalization of Brouwer's fixed point theorem to upper semicontinuous multivalued maps and is used extensively in game theory and other areas of economics. Earlier works have shown that Sperner's lemma…

We investigate the dependence of the center-of-mass tomogram of a system with many degrees of freedom $N$ on the Planck constant $\hbar $. It is shown that to use the central limit theorem under taking the limit $N\to +\infty $ one should…

We investigate the rate of convergence in the central limit theorem for convex sets. We obtain bounds with a power-law dependence on the dimension. These bounds are asymptotically better than the logarithmic estimates which follow from the…

In this paper, we first prove that the absorption law for one-sided inverses along an element holds, deriving the absorption law for the inverse along an element. We then apply this result to obtain the absorption law for the inverse along…

We establish the central limit theorem for linear processes with dependent innovations including martingales and mixingale type of assumptions as defined in McLeish [Ann. Probab. 5 (1977) 616--621] and motivated by Gordin [Soviet Math.…

The classical Ramsey theorem was generalized in two major ways: to the dual Ramsey theorem, by Graham and Rothschild, and to Ramsey theorems for trees, initially by Deuber and Leeb. Bringing these two lines of thought together, we prove the…

We obtain critical pair theorems for subsets S and T of an abelian group such that |S+T| < |S|+|T|+1. We generalize some results of Chowla, Vosper, Kemperman and a more recent result due to Rodseth and one of the authors.

This paper derives central limit and bootstrap theorems for probabilities that sums of centered high-dimensional random vectors hit hyperrectangles and sparsely convex sets. Specifically, we derive Gaussian and bootstrap approximations for…

The Generalized Central Limit Theorem is a remarkable generalization of the Central Limit Theorem, showing that the sum of a large number of independent, identically-distributed (i.i.d) random variables with infinite variance may converge…

This paper deals with the numerical approximation of normalizing constants produced by particle methods, in the general framework of Feynman-Kac sequences of measures. It is well-known that the corresponding estimates satisfy a central…

We establish a central limit theorem for the central values of Dirichlet $L$-functions with respect to a weighted measure on the set of primitive characters modulo $q$ as $q \rightarrow \infty$. Under the Generalized Riemann Hypothesis…

Let $f(x,y)$ be a complex irreducible formal power series without constant term. One may solve the equation $f(x,y)=0$ by choosing either $x$ or $y$ as independent variable, getting two finite sets of Newton-Puiseux series. In 1967 and…

We assume the Riemann hypothesis to improve upon the rate of convergence of $(\log\log\log T)^2/\sqrt{\log\log T}$ in Selberg's central limit theorem for $\log|\zeta(1/2+it)|$ given by the author. We achieve a rate of convergence of…

We present fully formalized proofs of some central theorems from combinatorics. These are Dilworth's decomposition theorem, Mirsky's theorem, Hall's marriage theorem and the Erd\H{o}s-Szekeres theorem. Dilworth's decomposition theorem is…

The Central Limit Theorem (CLT) establishes that sufficiently large sequences of independent and identically distributed random variables converge in probability to a normal distribution. This makes the CLT a fundamental building block of…

Two proofs of the Central Limit Theorem using a renormalization group approach are presented. The first proof is conducted under a third moment assumption and shows that a suitable renormalization group map is a contraction over the space…

This paper presents a curvature-free version of the Log(2k-1) Theorem of Anderson, Canary, Culler & Shalen [ACCS96]. It generalizes a result by Hou [Hou01] and its proof is rather straightforward once we know the work by Lim [Lim08] on…

Intransitive dice $D^{(1)}, \ldots, D^{(\ell)}$ are dice such that $D^{(1)}$ has advantage when played against $D^{(2)}$, dice $D^{(2)}$ has advantage when played against $D^{(3)}$ and so on, up to $D^{(\ell)}$, which has advantage over…

P. Frankl and J. Pach proved the following uniform version of Sauer's Lemma. Let $n,d,s$ be natural numbers such that $d\leq n$, $s+1\leq n/2$. Let $\cF \subseteq {[n] \choose d}$ be an arbitrary $d$-uniform set system such that $\cF$ does…