相关论文: A Van der Waerden-free proof of Rado's theorem

Building on previous work of Di Nasso and Luperi Baglini, we provide general necessary conditions for a Diophantine equation to be partition regular. These conditions are inspired by Rado's characterization of partition regular linear…

We prove general sufficient and necessary conditions for the partition regularity of Diophantine equations, which extend the classic Rado's Theorem by covering large classes of nonlinear equations. Sufficient conditions are obtained by…

We extend classical results of Rado on partition regularity of systems of linear equations with integer coefficients to the case when the coefficient ring is either an arbitrary integral domain or a noetherian ring. In particular, we show…

The Rado-Horn theorem provides necessary and sufficient conditions for when a collection of vectors can be partitioned into a fixed number of linearly independent sets. Such partitions exist if and only if every subset of the vectors…

We consider systems of $n$ diagonal equations in $k$th powers. Our main result shows that if the coefficient matrix of such a system is sufficiently non-singular, then the system is partition regular if and only if it satisfies Rado's…

We establish partition regularity of the generalised Pythagorean equation in five or more variables. Furthermore, we show how Rado's characterisation of a partition regular equation remains valid over the set of positive $k$th powers,…

Rado's Theorem characterizes the systems of homogenous linear equations having the property that for any finite partition of the positive integers one cell contains a solution to these equations. Furstenberg and Weiss proved that solutions…

We study Rado functionals and the maximal condition (first introduced by J. M. Barret et al.) in terms of the partition regularity of mixed systems of linear equations and inequalities. By strengthening the maximal Rado condition, we…

The famous van der Waerden theorem states that if partition N into finitely many cells then one of them will contain arbitrary length arithmetic progressions. It has a polynomial version also. In this article we will prove the near 0…

We give a purely combinatorial proof for the infinitary van der Waerden's theorem.

Here we answer a conjecture by Ron Graham about getting finer upper bounds for van der Waerden numbers in the affirmative, but without the application of double induction or combinatorics as applied to sets of integers that contain some van…

By using nonstandard analysis, and in particular iterated hyper-extensions, we give foundations to a peculiar way of manipulating ultrafilters on the natural numbers and their pseudo-sums. The resulting formalism is suitable for…

In this paper, we present a simplified proof of Rado's Theorem and demonstrate that when an integer matrix $M$ satisfies the column condition and $M\mathbf x=\mathbf 0$ has an element-distinct solution on $\mathbb N$, then under any finite…

We present a self-contained proof of a strong version of van der Waerden's Theorem. By using translation invariant filters that are maximal with respect to inclusion, a simple inductive argument shows the existence of "piecewise…

We study systems of functional equations whose solutions can be parameterized in function of one variable; our main result proves that the partition regularity (PR) of such systems can be completely characterized by the existence of…

There is the classical Radon theorem. Given integer $d \geq 1$ and $d+2$ points in d-dimensional space $R^d$. Then these points can be divided into two disjoint subsets whose convex hulls have a non-empty intersection. The original proof of…

We establish a general structure theorem for the singular part of ${\mathscr A}$-free Radon measures, where ${\mathscr A}$ is a linear PDE operator. By applying the theorem to suitably chosen differential operators ${\mathscr A}$, we obtain…

Since the theorems of Schur and van der Waerden, numerous partition regularity results have been proved for linear equations, but progress has been scarce for non-linear ones, the hardest case being equations in three variables. We prove…

We present a new short proof of Van der Waerden's Theorem about the existence of arbitrarily long monochromatic arithmetic progressions. The proof uses algebra in the compact space of ultrafilters $\beta\N$, but contrarily to the other…

An elementary proof of Bertrand's theorem is given by examining the radial orbit equation, without needing to solve complicated equations or integrals.