Related papers: Selection principles and proofs from the Book

It is well known that the Fourier--Bohr coefficients of regular model sets exist and are uniformly converging, volume-averaged exponential sums. Several proofs for this statement are known, all of which use fairly abstract machinery. For…

We study algorithmically random closed subsets of $2^\omega$, algorithmically random continuous functions from $2^\omega$ to $2^\omega$, and algorithmically random Borel probability measures on $2^\omega$, especially the interplay between…

We consider four problems. Rogers proved that for any convex body $K$, we can cover ${\mathbb R}^d$ by translates of $K$ of density very roughly $d\ln d$. First, we extend this result by showing that, if we are given a family of positive…

We show an extension of a probabilistic result of Marcus, Spielman, and Srivastava, which resolved the Kadison-Singer problem, for block diagonal positive semidefinite random matrices. We use this result to show several selector results,…

For two-person dynamic zero-sum games (both discrete and continuous settings), we investigate the limit of value functions of finite horizon games with long run average cost as the time horizon tends to infinity and the limit of value…

In this article we introduce generalized projective spaces (Definitions $[2.1, 2.5]$) and prove three main theorems in two different contexts. In the first context we prove, in main Theorem $A$, the surjectivity of the Chinese remainder…

We establish relationships between various topological selection games involving the space of minimal usco maps with various topologies, including the topology of pointwise convergence and the topology of uniform convergence on compact…

We generalize Lindeberg's proof of the central limit theorem to an invariance principle for arbitrary smooth functions of independent and weakly dependent random variables. The result is applied to get a similar theorem for smooth functions…

Green, Tao and Ziegler prove ``Dense Model Theorems'' of the following form: if R is a (possibly very sparse) pseudorandom subset of set X, and D is a dense subset of R, then D may be modeled by a set M whose density inside X is…

In this paper we deal with a large class of dynamical systems having a version of the spectral gap property. Our primary class of systems comes from random dynamics, but we also deal with the deterministic case. We show that if a random…

In this paper, we show a mean convergence theorem for a mapping with an attractive point in a Hilbert space by using a quasinonexpansive extension of the mapping and a mean convergence theorem for a quasinonexpansive mapping.

We study algorithmic randomness notions via effective versions of almost-everywhere theorems from analysis and ergodic theory. The effectivization is in terms of objects described by a computably enumerable set, such as lower semicomputable…

We extend the Hairer reconstruction theorem for distributions due to Caravenna and Zambotti (arXiv:2005.09287) to general function spaces satisfying a translation and scaling condition. This includes Besov type spaces with exponents below 1…

We show that every nearly spherical manifold can be realized as the volume-preserving image of a round sphere, via the Brenier-McCann optimal transport map. This theorem extends Caffarelli's contraction theorem to nearly spherical manifolds…

We establish relationships between various topological selection games involving the space of minimal cusco maps into the real line and the underlying domain. These connections occur across different topologies, including the topology of…

Recently Conlon, Fox, and the author gave a new proof of a relative Szemer\'edi theorem, which was the main novel ingredient in the proof of the celebrated Green-Tao theorem that the primes contain arbitrarily long arithmetic progressions.…

In a 1983 paper, Yannelis-Prabhakar rely on Michael's selection theorem to guarantee a continuous selection in the context of the existence of maximal elements and equilibria in abstract economies. In this tribute to Nicholas Yannelis, we…

Kemeny's rule is one of the most studied and well-known voting schemes with various important applications in computational social choice and biology. Recently, Kemeny's rule was generalized via a set-wise approach by Gilbert et. al. This…

An outlier is a datapoint that is set apart from a sample population. The outlier theorem in algorithmic information theory states that given a computable sampling method, outliers must appear. We present a simple proof to the outlier…

We prove that the propositional translations of the Kneser-Lov\'asz theorem have polynomial size extended Frege proofs and quasi-polynomial size Frege proofs. We present a new counting-based combinatorial proof of the Kneser-Lov\'asz…