Related papers: On the infinitary van der Waerden Theorem

For a given length and a given degree and an arbitrary partition of the positive integers, there always is a cell containing a polynomial progression of that length and that degree; moreover, the coefficients of the generating polynomial…

We present an elementary proof of Fermat's Last Theorem. No ancillary results are used, not even the most basic ones. The proof directly leads to a contradiction of the Fermat equation in the set of integers.

Ultrafilters are very useful and versatile objects with applications throughout mathematics: in topology, analysis, combinarotics, model theory, and even theory of social choice. Proofs based on ultrafilters tend to be shorter and more…

This paper gives a self-contained group-theoretic proof of a dual version of a theorem of Ore on distributive intervals of finite groups. We deduce a bridge between combinatorics and representations in finite group theory.

We establish a new simple explicit description of combinatorial wall-crossing for the rational Cherednik algebra applied to the trivial representation. In this way we recover a theorem of P. Dimakis and G. Yue. We also present two…

We lay the combinatorial foundations for [ShSt:340] by setting up and proving the essential properties of the coding apparatus for singular cardinals. We also prove another result concerning the coding apparatus for inaccessible cardinals.

A proof of Sharkovsky's Theorem is given. It is shown how this proof naturally generalizes to looking at maps on graphs and to Sharkovsky-type theorems for these maps. The paper is written at an elementary level and is meant as an…

We prove that for a discrete, countable, and amenable group $G$, if the direct product $G^2=G \times G$ is finitely colored then $\{ g \in G : \text{exists } (x,y) \in G^2 \text{ such that } \{ (x,y),(xg,y),(xg,yg)\} \text{ is…

We give a simple proof of Bourgain's theorem on the singularity of Ornstein's maps.

In this note we present a simple upper bound for the row-wise norm of the inverses of general confluent Vandermonde matrices.

We prove Union-Closed sets conjecture.

Van der Waerden's theorem asserts that if you color the natural numbers with, say, five different colors, then you can always find arbitrarily long sequences of numbers that have the same color and that form an arithmetic progression.…

Wei's celebrated Duality Theorem is generalized in several ways, expressed as duality theorems for linear codes over division rings and, more generally, duality theorems for matroids. These results are further generalized, resulting in two…

We prove a generalization of Istvan F\'ary's celebrated theorem to higher dimension.

I give a proof of the uniform boundedness theorem that is elementary (i.e. does not use any version of the Baire category theorem) and also extremely simple.

In this paper, we present an infinitesimal version of the Stone-von Neumann Theorem. This work was motivated by the need to formulate the uniqueness property of the Heisenberg Commutation Relation purely in terms of unbounded operators.

An technically interesting proof of a known theorem.

We describe some combinatorial problems in finite projective planes and indicate how R\'edei's theory of lacunary polynomials can be applied to them.

In this paper we are concerned with a Gordan-type theorem involving an arbitrary number of inequality functions. We not only state its validity under a weak convexity assumption on the functions, but also show it is an optimal result. We…

We provide a proof of Wilson's Theorem and Wolstenholme's Theorem based on a direct approach by Lagrange requiring only basic properties of the primes and the Binomial theorem. The goal is to show how similar the two theorems are by…