English
Related papers

Related papers: A Multidimensional Rado Theorem

200 papers

A $\textit{ladder}$ is a set $S \subseteq \mathbb Z^+$ such that any finite coloring of $\mathbb Z$ contains arbitrarily long monochromatic progressions with common difference in $S$. Van der Waerden's theorem famously asserts that $\mathbb…

Combinatorics · Mathematics 2017-06-07 Aaron Berger

Motivated by applications in combinatorial geometry, we consider the following question: Let $\lambda=(\lambda_1,\lambda_2,\ldots,\lambda_m)$ be an $m$-partition of a positive integer $n$, $S_i \subseteq \mathbb{C}^{\lambda_i}$ be finite…

Combinatorics · Mathematics 2022-04-13 M. Levent Doğan , Alperen A. Ergür , Jake D. Mundo , Elias Tsigaridas

It is proved that if we partition a $d$-dimensional cube into $n^d$ small cubes and color the small cubes into $m+1$ colors then there exists a monochromatic connected component consisting of at least $f(d, m) n^{d-m}$ small cubes.

Combinatorics · Mathematics 2013-08-23 Roman Karasev

A famous result in arithmetic Ramsey theory says that for many linear homogeneous equations $E$ there is a threshold value $R_k(E)$ (the Rado number of $E$) such that for any $k$-coloring of the integers in the interval $[1,n]$, with $n \ge…

Combinatorics · Mathematics 2024-10-30 Jesús A. De Loera , Denae Ventura , Liuyue Wang , William J. Wesley

We show that any $2$-coloring of $\mathbb{N}$ contains infinitely many monochromatic sets of the form $\{x,y,xy,x+y\},$ and more generally monochromatic sets of the form $\{x_i,\prod x_i,\sum x_i: i\leq k\}$ for any $k\in\mathbb{N}.$ Along…

Combinatorics · Mathematics 2022-05-26 Matt Bowen

In the paper we prove, in particular, that for any measurable coloring of the euclidian plane into two colours there is a monochromatic triangle with some restrictions on the sides. Also we consider similar problems in finite fields…

Combinatorics · Mathematics 2015-07-24 Ilya D. Shkredov

Rademacher theorem asserts that Lipschitz continuous functions between Euclidean spaces are differentiable almost everywhere. In this work we extend this result to set-valued maps using an adequate notion of set-valued differentiability…

Classical Analysis and ODEs · Mathematics 2022-12-14 Aris Daniilidis , Marc Quincampoix

052<p type="texpara" tag="Body Text" et="abstract" >A completely $n$ -positive linear map from a locally $C^{\ast}$-algebra $A$ to another locally $C^{\ast}$-algebra $B $is an $n\times n$ matrix whose elements are continuous linear maps…

Operator Algebras · Mathematics 2007-05-23 Maria Joita

We give a full, correct proof of the following result, earlier claimed by Erd\H{o}s and Komj\'ath. If the Continuum Hypothesis holds then there is a coloring of the plane with countably many colors, with no monocolored right triangle.

Logic · Mathematics 2023-02-24 Balázs Bursics , Péter Komjáth

Our main aim in this paper is to introduce a general concept of multidimensional fixed point of a mapping in spaces with distance and establish various multidimensional fixed point results. This new concept simplifies the similar notion…

General Mathematics · Mathematics 2017-01-04 Mitrofan M. Choban , Vasile Berinde

We prove that the vertices of every $(r + 1)$-uniform hypergraph with maximum degree $\Delta$ may be coloured with $c(\frac{\Delta}{d + 1})^{1/r}$ colours such that each vertex is in at most $d$ monochromatic edges. This result, which is…

Combinatorics · Mathematics 2022-08-17 António Girão , Freddie Illingworth , Alex Scott , David R. Wood

In this paper, we study a Ramsey-type problem for equations of the form $ax+by=p(z)$. We show that if certain technical assumptions hold, then any 2-colouring of the positive integers admits infinitely many monochromatic solutions to the…

Combinatorics · Mathematics 2022-09-21 Zsolt Baja , Dániel Dobák , Benedek Kovács , Péter Pál Pach , Donát Pigler

We extend two well-known results in Ramsey theory from from $K_n$ to arbitrary $n$-chromatic graphs. The first is a note of Erd\H os and Rado stating that in every 2-coloring of the edges of $K_n$ there is a monochromatic tree on $n$…

Combinatorics · Mathematics 2015-06-16 Arie Bialostocki , Andras Gyarfas

We establish two versions of Vizing's theorem for Borel multi-graphs whose vertex degrees and edge multiplicities are uniformly bounded by respectively $\Delta$ and $\pi$. The ``approximate'' version states that, for any Borel probability…

Combinatorics · Mathematics 2020-07-21 Jan Grebík , Oleg Pikhurko

There exists a minimum integer $N$ such that any 2-coloring of $\{1,2,...,N\}$ admits a monochromatic solution to $x+y+kz =\ell w$ for $k,\ell \in \mathbb{Z}^+$, where $N$ depends on $k$ and $\ell$. We determine $N$ when $\ell-k \in…

Combinatorics · Mathematics 2007-07-02 Aaron Robertson , Kellen Myers

Fix integers $d,r\ge 2$ and suppose that the edge set of the $d$-fold Cartesian product of the $N$-clique $K_N^d$ is $r$-colored. We show that there is a copy of $K_n^d$ whose edges in each direction are monochromatic provided $N > 2^{2^{c…

Combinatorics · Mathematics 2025-01-15 Dhruv Mubayi

Schur's theorem states that in any $k$-colouring of the set of integers $[n]$ there is a monochromatic solution to $a+b=c$, provided $n$ is sufficiently large. Abbott and Wang studied the size of the largest subset of $[n]$ such that there…

Combinatorics · Mathematics 2026-02-17 Letícia Mattos , Domenico Mergoni Cecchelli , Olaf Parczyk

We prove that for every $m$ there is a finite point set $\mathcal{P}$ in the plane such that no matter how $\mathcal{P}$ is three-colored, there is always a disk containing exactly $m$ points, all of the same color. This improves a result…

Combinatorics · Mathematics 2020-11-25 Gábor Damásdi , Pálvölgyi Dömötör

This article resolves two related problems in Ramsey theory on the integers. We show that for any finite coloring of the set of natural numbers, there exist numbers $a$ and $b$ for which the configuration $\{a, b, ab, a(b+1)\}$ is…

Combinatorics · Mathematics 2026-03-17 Sayan Goswami

Let $G$ be a finite abelian group with exponent $n$, and let $r$ be a positive integer. Let $A$ be a $k\times m$ matrix with integer entries. We show that if $A$ satisfies some natural conditions and $|G|$ is large enough then, for each…

Combinatorics · Mathematics 2012-03-13 Oriol Serra , Lluís Vena