English
Related papers

Related papers: The interplay between additive and symmetric large…

200 papers

Many natural notions of additive and multiplicative largeness arise from results in Ramsey theory. In this paper, we explain the relationships between these notions for subsets of $\mathbb{N}$ and in more general ring-theoretic structures.…

Combinatorics · Mathematics 2024-09-11 Vitaly Bergelson , Daniel Glasscock

An old question in Ramsey theory asks whether any finite coloring of the natural numbers admits a monochromatic pair $\{x+y,xy\}$. We answer this question affirmatively in a strong sense by exhibiting a large new class of non-linear…

Combinatorics · Mathematics 2016-05-06 Joel Moreira

There is a long history of studying Ramsey theory using the algebraic structure of the Stone-\v{C}ech compactification of discrete semigroup. It has been shown that various Ramsey theoretic structures are contained in different algebraic…

General Topology · Mathematics 2021-08-12 Dibyendu De , Pintu Debnath , Sayan Goswami

In this article, we investigate homogeneous versions of certain nonlinear Ramsey-theoretic results, with three significant applications. As the first application, we prove that for every finite coloring of $\mathbb{Z}^+$, there exist an…

Combinatorics · Mathematics 2025-04-16 Sukumar Das Adhikari , Sayan Goswami

Ramsey theory looks for regularities in large objects. Model theory studies algebraic structures as models of theories. The structural Ramsey theory combines these two fields and is concerned with Ramsey-type questions about certain…

Combinatorics · Mathematics 2018-05-22 Matěj Konečný

We prove additive and multiplicative partition theorems, obtaining combinatorial results for p-quasicyclic groups, where p is a prime number. We also get density results for p-quasicyclic groups via left F{\o}lner sequences of non-empty…

Combinatorics · Mathematics 2014-08-19 Andreas Koutsogiannis

We introduce the notion of asymptotic partition regularity for Diophantine equations. We show how this notion is at the core of almost all known negative results in the Ramsey theory of equations, and we use it to produce new ones, as in…

Combinatorics · Mathematics 2025-10-23 Lorenzo Luperi Baglini , Alessandro Vegnuti

We show how multiplicatively syndetic sets can be used in the study of partition regularity of dilation invariant systems of polynomial equations. In particular, we prove that a dilation invariant system of polynomial equations is partition…

Combinatorics · Mathematics 2020-06-17 Jonathan Chapman

Some of the classical results of Ramsey Theory can be naturally stated in terms of image partition regularity of matrices. There have been many significant results of image partition regular matrices as well as image partition regular…

Combinatorics · Mathematics 2014-09-23 Tanushree Biswas

The partition algebras are algebras of diagrams (which contain the group algebra of the symmetric group and the Brauer algebra) such that the multiplication is given by a combinatorial rule and such that the structure constants of the…

Representation Theory · Mathematics 2007-05-23 Tom Halverson , Arun Ram

We study density and partition properties of polynomial equations in prime variables. We consider equations of the form $a_1h(x_1) + \cdots + a_sh(x_s)=b$, where the $a_i$ and $b$ are fixed coefficients, and $h$ is an arbitrary integer…

Number Theory · Mathematics 2024-11-27 Jonathan Chapman , Sam Chow

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…

Combinatorics · Mathematics 2021-01-19 Jordan Mitchell Barrett , Martino Lupini , Joel Moreira

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…

Combinatorics · Mathematics 2016-06-08 Mauro Di Nasso , Lorenzo Luperi Baglini

We address a core partition regularity problem in Ramsey theory by proving that every finite coloring of the positive integers contains monochromatic Pythagorean pairs, i.e., $x,y\in \mathbb{N}$ such that $x^2\pm y^2=z^2$ for some $z\in…

Combinatorics · Mathematics 2025-02-19 Nikos Frantzikinakis , Oleksiy Klurman , Joel Moreira

Partition regularity over algebraic structures is a topic in Ramsey theory that has been extensively researched by combinatorialists. Motivated by recent work in this area, we investigate the computability-theoretic and reverse-mathematical…

Logic · Mathematics 2026-01-14 Gabriela Laboska

We explore the properties of non-piecewise syndetic sets with positive upper density, which we call "discordant", in countably infinite amenable (semi)groups. Sets of this kind are involved in many questions of Ramsey theory and manifest…

Combinatorics · Mathematics 2022-04-12 Vitaly Bergelson , Jake Huryn , Rushil Raghavan

Suppose we partition the integers into finitely many cells. Can we always find a solution of the equation $x^2+y^2=z^2$ with $x,y,z$ on the same cell? What about more general homogeneous quadratic equations in three variables? These are…

Combinatorics · Mathematics 2025-08-08 Nikos Frantzikinakis

Let $P: \F \times \F \to \F$ be a polynomial of bounded degree over a finite field $\F$ of large characteristic. In this paper we establish the following dichotomy: either $P$ is a moderate asymmetric expander in the sense that $|P(A,B)|…

Combinatorics · Mathematics 2013-01-04 Terence Tao

In recent years, there has been much progress in the field of structural Ramsey theory, in particular in the study of big Ramsey degrees. In all known examples of infinite structures with finite big Ramsey degrees, there is in fact a single…

Logic · Mathematics 2025-10-01 Jan Hubička , Andy Zucker

This paper addresses two problems lying at the intersection of geometric analysis and theoretical computer science: The non-linear isomorphic Dvoretzky theorem and the design of good approximate distance oracles for large distortion. We…

Data Structures and Algorithms · Computer Science 2012-11-15 Manor Mendel , Assaf Naor
‹ Prev 1 2 3 10 Next ›