Related papers: An Elementary Proof of Jin's Theorem with a Bound
We give a proof of an infinitary version of the well known Hales-Jewett theorem on finite words avoiding the use of ultrafilters.
This note has two principal aims: to portray an essence of Non-Standard Analysis as a particular structure (which we call lim-rim), noting its interplay with the notion of ultrapower, and to present a construction of Non-Standard Analysis,…
A classical theorem of De Bruijn and Erd\H{o}s asserts that any noncollinear set of n points in the plane determines at least n distinct lines. We prove that an analogue of this theorem holds for graphs. Restricting our attention to…
In 1927, Artin conjectured that any integer other than -1 or a perfect square generates the multiplicative group $\mathbb{Z}/p\mathbb{Z}^\times$ for infinitely many $p$. In \cite{MoSt}, Moree and Stevenhagen considered a two-variable…
The fundamental result of Li, Long, and Srinivasan on approximations of set systems has become a key tool across several communities such as learning theory, algorithms, computational geometry, combinatorics and data analysis. The goal of…
In this paper we prove some uncertainty bounds for commutators and anti-commutators of observables in a $C^*$-algebra. We give a short, elementary proof of Robertson's Standard Uncertaity Principle in this setting. We also prove some other…
A famous theorem of Szemer\'edi asserts that given any density $0 < \delta \leq 1$ and any integer $k \geq 3$, any set of integers with density $\delta$ will contain infinitely many proper arithmetic progressions of length $k$. For general…
We give a new, self-contained proof of the multidimensional central limit theorem using the technique of ``doubling variables," which is traditionally used to prove uniqueness of solutions of partial differential equations (PDEs). Our…
We present an exposition of the *Chain Bounding Lemma*, which is a common generalization of both Zorn's Lemma and the Bourbaki-Witt fixed point theorem. The proofs of these results through the use of Chain Bounding are amongst the simplest…
We show that, for each real number $\alpha > 0$ and odd integer $k\ge 5$ there is an integer $c$ such that, if $M$ is a simple binary matroid with $|M| \ge \alpha 2^{r(M)}$ and with no $k$-element circuit, then $M$ has critical number at…
Using an adaptation of Qin Jiushao's method from the 13th century, it is possible to prove that a system of linear modular equations a(i,1) x(i) + ... + a(i,n) x(n) = b(i) mod m(i), i=1, ..., n has integer solutions if m(i)>1 are pairwise…
We present a new and direct proof of Grothendieck's generic freeness lemma in its general form. Unlike the previously published proofs, it does not proceed in a series of reduction steps and is fully constructive, not using the axiom of…
Let W be either the number of descents or inversions of a permutation. Stein's method is applied to show that W satisfies a central limit theorem with error rate n^(-1/2). The construction of an exchangeable pair (W,W') used in Stein's…
We prove the existence of primitive sets (sets of integers in which no element divides another) in which the gap between any two consecutive terms is substantially smaller than the best known upper bound for the gaps in the sequence of…
A non-classical formulation of the central limit theorem is given for sequences of independent random variables with finite second moments. Singular sequences whose members all have a degenerate or normal distribution are excluded from…
Answering affirmatively a 2007 problem of Chen, the first author proved that there is a unique representation basis $A$ of $\mathbb{Z}$ and a constant $c>0$ such that $$ A(-x,x)\ge c\sqrt{x} $$ for infinitely many positive integers $x$,…
This note shows that the three theorems presented in J. Math. Anal. Appl. 556 (2026), 130199, whose proofs, in their present formulation, are purely formal, follow from elementary calculus.
For $p$ being a large prime number, and $A \subset \mathbb{F}_p$ we prove the following: $(i)$ If $A(A+A)$ does not cover all nonzero residues in $\mathbb{F}_p$, then $|A| < p/8 + o(p)$. $(ii)$ If $A$ is both sum-free and satisfies $A =…
We provide a framework for proofs of structural theorems about sets with positive Banach logarithmic density. For example, we prove that if $A\subseteq \mathbb{N}$ has positive Banach logarithmic density, then $A$ contains an approximate…
We will prove the Berry-Esseen theorem for the number counting function of the circular $\beta$-ensemble (C$\beta$E), which will imply the central limit theorem for the number of points in arcs of the unit circle in mesoscopic and…