English
Related papers

Related papers: A Ramsey Theorem for Graded Lattices

200 papers

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…

Combinatorics · Mathematics 2020-05-11 Pintu Debnath , Sayan Goswami

We use the model theoretic notion of coheir to give short proofs of old and new theorems in Ramsey Theory. As an illustration we start from Ramsey's theorem itself. Then we prove Hindman's theorem and the Hales-Jewett theorem. Finally, we…

Combinatorics · Mathematics 2025-10-29 Eugenio Colla , Domenico Zambella

An abstract, Hales-Jewett type extension of the polynomial van der Waerden Theorem [J. Amer. Math. Soc. 9 (1996),725-753] is established: Theorem. Let r,d,q \in \N. There exists N \in \N such that for any r-coloring of the set of subsets of…

Combinatorics · Mathematics 2016-09-07 Vitaly Bergelson , Alexander Leibman

Ramsey theory is the study of conditions under which mathematical objects show order when partitioned. Ramsey theory on the integers concerns itself with partitions of $[1,n]$ into $r$ subsets and asks the question whether one (or more) of…

Combinatorics · Mathematics 2014-04-30 Mano Vikash Janardhanan

The Theorems of Hindman and van der Waerden belong to the classical theorems of partition Ramsey Theory. The Central Sets Theorem is a strong simultaneous extension of both theorems that applies to general commutative semigroups. We give a…

Combinatorics · Mathematics 2008-07-10 Mathias Beiglböck

Van der Waerden's theorem, published in Nieuw. Arch. Wisk. 15 (1927), acted as a catalyst for major further developments in Ramsey theory. In this survey, we delve into the legacy of this mathematical gem, tracing its historical origin,…

Combinatorics · Mathematics 2026-03-30 Vitaly Bergelson , Florian K. Richter

The main aim of the present note is to consider bounded orthomorphisms between locally solid vector lattices. We establish a version of the remarkable Zannen theorem regarding equivalence between orthomomorphisms and the underlying vector…

Functional Analysis · Mathematics 2020-12-18 Raheleh Sabbagh , Omid Zabeti

The class of finite distributive lattices, as many other classes of structures, does not have the Ramsey property. It is quite common, though, that after expanding the structures with appropriately chosen linear orders the resulting class…

Combinatorics · Mathematics 2018-02-06 Dragan Mašulović

We classify the Boolean degree $1$ functions of $k$-spaces in a vector space of dimension $n$ (also known as Cameron-Liebler classes) over the field with $q$ elements for $n \geq n_0(k, q)$. This also implies that two-intersecting sets with…

Combinatorics · Mathematics 2024-05-28 Ferdinand Ihringer

We prove a Ramsey theorem for finite sets equipped with a partial order and a fixed number of linear orders extending the partial order. This is a common generalization of two recent Ramsey theorems due to Soki\'c. As a bonus, our proof…

Combinatorics · Mathematics 2015-02-17 Slawomir Solecki , Min Zhao

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…

Combinatorics · Mathematics 2007-05-23 Rudi Hirschfeld

In this note we consider a Ramsey type result for partially ordered sets. In particular, we give an alternative short proof of a theorem for a posets with multiple linear extensions recently obtained by Solecki and Zhao.

Combinatorics · Mathematics 2016-08-19 Andrii Arman , Vojtěch Rödl

Ultrafilters are a tool, originating in mathematical logic and general topology, that has steadily found more and more uses in multiple areas of mathematics, such as combinatorics, dynamics, and algebra, among others. The purpose of this…

Combinatorics · Mathematics 2022-03-01 David J. Fernández-Bretón

It was shown by V. Bergelson that any set B with positive upper multiplicative density contains nicely intertwined arithmetic and geometric progressions: For each positive integer k there exist integers a,b,d such that $ {b(a+id)^j:i,j…

Combinatorics · Mathematics 2014-02-26 Mathias Beiglböck

We review principal results on axiomatizability of classes of lattices of equivalences

Logic · Mathematics 2025-07-29 Christian Herrmann

In [Adv. Math., 321 (2017) 269-286], using the theory of ultrafilters, J. H. Johnson Jr., and F. K. Richter proved the nilpotent polynomial Hales-Jewett theorem. Using this result they proved the restricted version of the van der Waerden…

Combinatorics · Mathematics 2024-08-27 Sayan Goswami

We construct a logarithmic model of connections on smooth quasi-projective $n$-dimensional geometrically irreducible varieties defined over an algebraically closed field of characteristic $0$. It consists of a good compactification of the…

Algebraic Geometry · Mathematics 2019-05-03 Hélène Esnault , Claude Sabbah

We study the positions in the Weihrauch lattice of parallel products of various combinatorial principles related to Ramsey's theorem. Among other results, we obtain an answer to a question of Brattka, by showing that Ramsey's theorem for…

We previously extended the Marsden-Ratiu reduction theorem in Poisson geometry by means of graded geometry (see Part I of Arxiv:1009.0948) . In this note we provide the background material about graded geometry necessary for the proof.…

Symplectic Geometry · Mathematics 2020-03-13 Alberto S. Cattaneo , Marco Zambon

A resolution of the intersection of a finite number of subgroups of an abelian group by means of their sums is constructed, provided the lattice generated by these subgroups is distributive. This is used for detecting singularities of…

K-Theory and Homology · Mathematics 2009-11-02 Tomasz Maszczyk
‹ Prev 1 2 3 10 Next ›