Related papers: Gacs-Kucera Theorem

This paper presents an exposition of Rio's proof of the strong law of large numbers and extends his method to random fields. In addition to considering the rate of convergence in the Marcinkiewicz--Zygmund strong law of large numbers, we go…

Geoffrion's theorem is a fundamental result from mathematical programming assessing the quality of Lagrangian relaxation, a standard technique to get bounds for integer programs. An often implicit condition is that the set of feasible…

The randomized Gauss--Seidel method and its extension have attracted much attention recently and their convergence rates have been considered extensively. However, the convergence rates are usually determined by upper bounds, which cannot…

We present a local convergence analysis of the Gauss-Newton-Kurchatov method for solving nonlinear least squares problems with a decomposition of the operator. The method uses the sum of the derivative of the differentiable part of the…

While Kolmogorov's probability axioms are widely recognized, it is less well known that in an often-overlooked 1930 note, Kolmogorov proposed an axiomatic framework for a unifying concept of the mean -- referred to as regular means. This…

A famous conjecture of Graham asserts that every set $A \subseteq \mathbb{Z}_p \setminus \{0\}$ can be ordered so that all partial sums are distinct. Although this conjecture was recently proved for sufficiently large primes by Pham and…

Given a simple Lie group $G$, we show that the lattices in $G$ are weakly uniformly discrete. This is a strengthening of the Kazhdan-Margulis theorem. Our proof however is straightforward --- considering general IRS rather than lattices…

Universality of local eigenvalue statistics is one of the most striking phenomena of Random Matrix Theory, that also accounts for a lot of the attention that the field has attracted over the past 15 years. In this paper we focus on the…

We generalize the feasible interpolation theorem for semantic derivations from K.(1997) by allowing randomized protocols (protocols in the sense of K.(1997). We also introduce an extension of the monotone circuit model, monotone circuits…

A beautiful theorem of Zeckendorf states that every positive integer has a unique decomposition as a sum of non-adjacent Fibonacci numbers. Such decompositions exist more generally, and much is known about them. First, for any positive…

Through a reformulation of the local limit theorem and law of small numbers, which is obtained by working in the spaces naturally associated to the limiting distributions, we discover a general and abstract framework for the investigation…

We generalise the results by Bigorajska and Kotlarski about partitioning $\alpha$-large sets, by extending the domain up to ordinals below $\varepsilon_{\omega}$. These results will be very useful to give a miniaturisation of the infinite…

We give a simple and entirely elementary proof of Gasper's theorem on the Markov sequence problem for Jacobi polynomials. It is based on the spectral analysis of an operator that arises in the study of a probabilistic model of colliding…

The $k$-cut number of rooted graphs was introduced by Cai et al. as a generalization of the classical cutting model by Meir and Moon. In this paper, we show that all moments of the k-cut number of conditioned Galton-Watson trees converges…

We provide a generalisation of Pinelis' Rademacher-Gaussian tail comparison to complex coefficients. We also establish uniform bounds on the probability that the magnitude of weighted sums of independent random vectors uniform on Euclidean…

We describe an error in the proof of a key proposition, which was necessary for the proof of the main result. Alternate proofs of the main result are given by Ozsvath-Stipsicz-Szabo and Dai-Hom-Stoffregen-Truong.

This paper introduces a new method for performing computational inference on log-Gaussian Cox processes. The likelihood is approximated directly by making novel use of a continuously specified Gaussian random field. We show that for…

Words are sequences of letters over a finite alphabet. We study two intimately related topics for this object: quasi-randomness and limit theory. With respect to the first topic we investigate the notion of uniform distribution of letters…

A two-dimensional Gauss-Kuzmin theorem for $N$-continued fraction expansions is shown. More exactly, we obtain a Gauss-Kuzmin theorem related to the natural extension of the measure-dynamical system corresponding to these expansions. Then,…

We continue the study of robust reductions initiated by Gavalda and Balcazar. In particular, a 1991 paper of Gavalda and Balcazar claimed an optimal separation between the power of robust and nondeterministic strong reductions.…