English
Related papers

Related papers: Monochromatic non-commuting products

200 papers

The main result provide a common generalization for Ramsey-type theorems concerning finite colorings of edge sets of complete graphs with vertices in infinite semigroups. We capture the essence of theorems proved in different fields: for…

Combinatorics · Mathematics 2021-07-08 Piotr Szewczak

In this paper we introduce mixed coloured permutation, permutations with certain coloured cycles, and study the enumerative properties of these combinatorial objects. We derive the generating function, closed forms, recursions and…

Combinatorics · Mathematics 2019-03-19 Beáta Bényi , Daniel Yaqubi

We define a new type of vertex coloring which generalizes vertex coloring in graphs, hypergraphs, and simplicial complexes. This coloring also generalizes oriented coloring, acyclic coloring, and star coloring. There is an associated…

Combinatorics · Mathematics 2020-01-22 John Machacek

The solution to the problem of finding the minimum number of monochromatic triples $(x,y,x+ay)$ with $a\geq 2$ being a fixed positive integer over any 2-coloring of $[1,n]$ was conjectured by Butler, Costello, and Graham (2010) and…

Combinatorics · Mathematics 2021-06-25 Thotsaporn Thanatipanonda , Elaine Wong

We show that for $m, r \in \mathbb{N}$ and $N > (2m+1)^r (r!)^{1/m}$, every $r$-coloring of the integers in the interval $[N]$ contains a monochromatic solution to the equation \[ x_1 + \dots + \dots x_{m+1} = y_1 + \dots + y_m. \] This…

Combinatorics · Mathematics 2026-05-15 Rafael Miyazaki , Eion Mulrenin , Cosmin Pohoata , Michael Zheng

We establish a polynomial ergodic theorem for actions of the affine group of a countable field $K$. As an application, we deduce--via a variant of Furstenberg's correspondence principle--that for fields of characteristic zero, any "large"…

Combinatorics · Mathematics 2026-01-14 Ioannis Kousek

Given a coloring of the k-element subsets of an uncountable separable metric space, we show that there exists an infinite monochromatic subset which contains its limit point.

Metric Geometry · Mathematics 2015-08-11 Shai Rosenberg

W. T. Gower generalized Hindman's Finite sum theorem over $X_{k}=\left\{ \left(n_{1},n_{2},\ldots,n_{k}\right):n_{1}\neq0\right\} $ by showing that for any finite coloring of $X_{k}$ there exists a sequence such that the Gower subspace…

Combinatorics · Mathematics 2022-10-31 Sayan Goswami

In this paper, we consider infinite words that arise as fixed points of primitive substitutions on a finite alphabet and finite colorings of their factors. Any such infinite word exhibits a "hierarchal structure" that will allow us to…

Combinatorics · Mathematics 2016-05-31 A. Bernardino , M. Silva , R. Pacheco

The paper is devoted to the study of combinatorial determinacy properties of a family of substitution complexes consisting of quadrilaterals glued side-to-side with each other. These properties are useful in constructing algebraic…

Rings and Algebras · Mathematics 2023-04-25 I. A. Ivanov-Pogodaev

We establish necessary and sufficient conditions for convergence (in the sense of finite dimensional distributions) of multiplicative measures on the set of partitions. We show that this convergence is equivalent to asymptotic independence…

Probability · Mathematics 2012-02-28 Boris L. Granovsky

Suppose that $\mathbb{N}$ is $2$-coloured. Then there are infinitely many monochromatic solutions to $x + y = z^2$. On the other hand, there is a $3$-colouring of $\mathbb{N}$ with only finitely many monochromatic solutions to this…

Number Theory · Mathematics 2016-08-31 Ben Green , Sofia Lindqvist

In Euclidean Ramsey Theory usually we are looking for monochromatic configurations in the Euclidean space, whose points are colored with a fixed number of colors. In the canonical version, the number of colors is arbitrary, and we are…

Combinatorics · Mathematics 2026-02-03 Panna Gehér , Arsenii Sagdeev , Géza Tóth

A particular case of the Hindman--Galvin--Glazer theorem states that, for every partition of an infinite abelian group $G$ into two cells, there will be an infinite $X\subseteq G$ such that the set of its finite sums…

Logic · Mathematics 2020-06-02 David Fernández-Bretón , Sung Hyup Lee

Raimi's theorem guarantees the existence of a partition of $\mathbb{N}$ into two parts with an unavoidable intersection property: for any finite coloring of $\mathbb{N}$, some color class intersects both parts infinitely many times, after…

Combinatorics · Mathematics 2026-01-01 Norbert Hegyvari , Janos Pach , Thang Pham

We establish a "diagonal" ergodic theorem involving the additive and multiplicative groups of a countable field $K$ and, with the help of a new variant of Furstenberg's correspondence principle, prove that any "large" set in $K$ contains…

Combinatorics · Mathematics 2015-10-14 Vitaly Bergelson , Joel Moreira

Inspired by Owings's problem, we investigate whether, for a given an Abelian group $G$ and cardinal numbers $\kappa,\theta$, every colouring $c:G\longrightarrow\theta$ yields a subset $X\subseteq G$ with $|X|=\kappa$ such that $X+X$ is…

Let $X,Y$ be finite sets, $r,s,h, \lambda \in \mathbb{N}$ with $s\geq r, X\subsetneq Y$. By $\lambda \binom{X}{h}$ we mean the collection of all $h$-subsets of $X$ where each subset occurs $\lambda$ times. A coloring of…

Combinatorics · Mathematics 2020-09-23 Amin Bahmanian , Sadegheh Haghshenas

Let $G \leq \mathrm{Sym} (X)$ for a countable set $X$. Call a colouring of $X$ asymmetric, if the identity is the only element of $G$ which preserves all colours. The motion (also called minimal degree) of $G$ is the minimal number of…

Group Theory · Mathematics 2022-09-23 Florian Lehner

In this paper we prove that if $S$ is any finite configuration of points in $\mathbb{Z}^2$, then any finite coloring of $\mathbb{E}^2$ must contain uncountably many monochromatic subsets homothetic to $S$. We extend a result of Brown,…

Combinatorics · Mathematics 2013-04-09 Jeremy F. Alm