Related papers: Sieving and the Erd{\H o}s-Kac theorem
In this note we present a proof of multiple recurrence for ergodic systems (and thereby of Szemer\'edi's theorem) being a mixture of three known proofs. It is based on a conditional version of the Jacobs-de Leeuw-Glicksberg decomposition…
According to the Erd\H{o}s-Szekeres theorem, for every $n$, a sufficiently large set of points in general position in the plane contains $n$ in convex position. In this note we investigate the line version of this result, that is, we want…
Proof search has been used to specify a wide range of computation systems. In order to build a framework for reasoning about such specifications, we make use of a sequent calculus involving induction and co-induction. These proof principles…
By any account, the 1998 proof of the Kepler conjecture is complex. The thesis underlying this article is that the proof is complex because it is highly under-automated. Throughout that proof, manual procedures are used where automated ones…
The classical Erd{\" o}s-Turan Inequality bounds how far a sequence of points in the circle is from being equidistributed in terms of its exponential moments. We prove an analogous inequality for all compact simply-connected semisimple Lie…
An technically interesting proof of a known theorem.
We give a new proof of Tietze Theorem on the convergence of infinite semi-regular continued fractions.
We add another brick to the large building comprising proofs of Pick's theorem. Although our proof is not the most elementary, it is short and reveals a connection between Pick's theorem and the pointwise convergence of multiple Fourier…
This article will prove a theorem for the existence of k-factor for k>1 ,and present an efficient algorithm for computing k-factor for all values of k based on this theorem.
We give a short combinatorial proof of the classical pointwise ergodic theorem for probability measure preserving $\mathbb{Z}$-actions. Our approach reduces the theorem to a tiling problem: tightly tile each orbit by intervals with desired…
In this note we give a detailed proof of certain results on geometry of numbers in the $S$-adic case. These results are well-known to experts, so the aim here is to provide a convenient reference for the people who need to use them.
A classic theorem of Erd\H{o}s and P\'osa (1965) states that every graph has either $k$ vertex-disjoint cycles or a set of $O(k \log k)$ vertices meeting all its cycles. While the standard proof revolves around finding a large `frame' in…
We consider modal logic extended with the well-known temporal operator 'eventually' and provide a cut-elimination procedure for a cyclic sequent calculus that captures this fragment. The work showcases an adaptation of the reductive…
A keyring is a graph obtained by appending $r \geq 1$ leaves to one of the vertices of a cycle. We prove that for every $r \leq (k-1)/2$, any graph with average degree more than $k-1$ contains a keyring with $r$ leaves and at least $k$…
There are several techniques in classical case for some PDEs, involving the concept of entropy to show convergence of solutions to a steady state. In this work we deal with the $p$-adic scattering equation and we try to adapt these methods…
We show that for a minimal system $(X,T)$, the set of saturated points along cubes with respect to its maximal $\infty$-step pro-nilfactor $X_\infty$ has a full measure. As an application, it is shown that if a minimal system $(X,T)$ has no…
We apply a classic result in Theoretical Computer Science to solve a sticky problem, and give a neat and slick quick proof of half of it
The edge-of-the-wedge theorem in several complex variables gives the analytic continuation of functions defined on the poly upper half plane and the poly lower half plane, the set of points in $\mathbb{C}^d$ with all coordinates in the…
Sine-skewed circular distributions are identifiable and have easily-computable trigonometric moments and a simple random number generation algorithm, whereas they are known to have relatively low levels of asymmetry. This study proposes a…
The use of Cauchy's method to prove Euler's well-known formula is an object of many controversies. The purpose of this paper is to prove that Cauchy's method applies for convex polyhedra and not only for them, but also for surfaces such as…