Related papers: A Pythagoras proof of Szemer\'edi's regularity lem…

We present a short proof of Szemer\'edi's Theorem using a dynamical system enriched by ideas from model theory. The resulting proof contains features reminiscent of proofs based on both ergodic theory and on hypergraph regularity.

Szemer\'edi's regularity lemma is a basic tool in graph theory, and also plays an important role in additive combinatorics, most notably in proving Szemer\'edi's theorem on arithmetic progressions . In this note we revisit this lemma from…

We extend Szemeredi's Regularity Lemma (SRL) to abstract measure spaces. Our main aim is to find general conditions under which the original proof of Szemeredi still works. To illustrate that our approach has some merit, we outline several…

We prove a variant of the abstract probabilistic version of Szemer\'edi's regularity lemma, due to Tao, which applies to a number of structures (including graphs, hypergraphs, hypercubes, graphons, and many more) and works for random…

We prove analogues for hypergraphs of Szemer\'edi's regularity lemma and the associated counting lemma for graphs. As an application, we give the first combinatorial proof of the multidimensional Szemer\'edi theorem of Furstenberg and…

In this article using elementary school level Geometry we observe an alternative proof of Pythagorean Theorem from Heron's Formula.

Green [Geometric and Functional Analysis 15 (2005), 340--376] established a version of the Szemer\'edi Regularity Lemma for abelian groups and derived the Removal Lemma for abelian groups as its corollary. We provide another proof of his…

Szemeredi's regularity lemma is one instance in a family of regularity lemmas, replacing the definition of density of a graph by a more general coefficient. Recently, Fan Chung proved another instance, a regularity lemma for clustering…

We present a nonstandard simple elementary proof of Szemer\'{e}di's theorem by a straightforward induction with the help of three levels of infinities and four different elementary embeddings in a nonstandard universe.

Addressing a question of Gowers, we determine the order of the tower height for the partition size in a version of Szemer\'edi's regularity lemma.

We introduce a new, elementary method for studying random differences in arithmetic progressions and convergence phenomena along random sequences of integers. We apply our method to obtain significant improvements on previously known…

We give a brief historical overview of the famous Pythagoras' theorem and Pythagoras. We present a simple proof of the result and dicsuss some extensions. We follow \cite{thales}, \cite{wiki} and \cite{wiki2} for the historical comments and…

Let G be a finite graph with the non-k-order property (essentially, a uniform finite bound on the size of an induced sub-half-graph). A major result of the paper applies model-theoretic arguments to obtain a stronger version of…

We propose two new proofs of the Pythagorean theorem via area rearrangement arguments starting from very simple geometric configurations. The constructions depend on an angular parameter, each choice of which yields a proof. For specific…

We re-derive Thales, Pythagoras, Apollonius, Stewart, Heron, al Kashi, de Gua, Terquem, Ptolemy, Brahmagupta and Euler's theorems as well as the inscribed angle theorem, the law of sines, the circumradius, inradius and some angle bisector…

The leading idea of the paper is to treat the theorem of Wigner with methods inspired by geometry. The exercise mentionned in the title has two functions: On the one hand it can serve as a pedagogical text in order to make the reader…

In this paper I present a kind of proof for classical Euclidean geometric problems which relies on both synthetic and analytic geometry. Using the elementary tools of polynomial algebra and multivariate calculus we manage to reduce the…

Only very recently a trigonometric proof of the Pythagoras theorem was given by Zimba \cite{1}, many authors thought this was not possible. In this note we give other trigonometric proofs of Pythagoras theorem by establishing,…

We prove a far-reaching strengthening of Szemer\'edi's regularity lemma for intersection graphs of pseudo-segments. It shows that the vertex set of such a graph can be partitioned into a bounded number of parts of roughly the same size such…

We give a simple and natural (probabilistic) construction of hypergraph regularization. It is done just by taking a constant-bounded number of random vertex samplings only one time (thus, iteration-free). It is independent from the…