Related papers: Homogeneous Dual Ramsey Theorem

The book graph $B_n^{(k)}$ consists of $n$ copies of $K_{k+1}$ joined along a common $K_k$. In the prequel to this paper, we studied the diagonal Ramsey number $r(B_n^{(k)}, B_n^{(k)})$. Here we consider the natural off-diagonal variant…

For each integer q>0 there is a cohomology theory such that the zero cohomology group of a manifold N of dimension n is a certain group of cobordism classes of proper fold maps of manifolds of dimension n+q into N. We prove a splitting…

In the present paper we initiate the study of a certain kind of partition inequality, by showing, for example, that if $M\geq 5$ is an integer and the integers $a$ and $b$ are relatively prime to $M$ and satisfy $1\leq a<b<M/2$, and the…

We prove a common generalization to several mass partition results using hyperplane arrangements to split $\mathbb{R}^d$ into two sets. Our main result implies the ham-sandwich theorem, the necklace splitting theorem for two thieves, a…

Let $M$ be a positive integer and $p(n)$ be the number of partitions of a positive integer $n$. Newman's Conjecture asserts that for each integer $r$, there are infinitely many positive integers $n$ such that \[ p(n)\equiv r \pmod{M}. \]…

Let $R_k(H;K_m)$ be the smallest number $N$ such that every coloring of the edges of $K_{N}$ with $k+1$ colors has either a monochromatic $H$ in color $i$ for some $1\leqslant i\leqslant k$, or a monochromatic $K_{m}$ in color $k+1$. In…

Let $\ell_m$ be a sequence of $m$ points on a line with consecutive points of distance one. For every natural number $n$, we prove the existence of a red/blue-coloring of $\mathbb{E}^n$ containing no red copy of $\ell_2$ and no blue copy of…

Given positive measures $\nu,\mu$ on an arbitrary measurable space $(\Omega, \mathcal F)$, we construct a sequence of finite partitions $(\pi_n)_n$ of $(\Omega, \mathcal F)$ s.t. $$ \sum_{A\in \pi_n: \mu(A)>0} 1_{A} \frac{\nu(A)}{\mu(A)}…

In this paper we consider the following question in the spirit of Ramsey theory: Given $x\in A^\omega,$ where $A$ is a finite non-empty set, does there exist a finite coloring of the non-empty factors of $x$ with the property that no…

We study divisibility properties of certain sums and alternating sums involving binomial coefficients and powers of integers. For example, we prove that for all positive integers $n_1,..., n_m$, $n_{m+1}=n_1$, and any nonnegative integer…

Let $m$ be a positive integer and $b_{m}(n)$ be the number of partitions of $n$ with parts being powers of 2, where each part can take $m$ colors. We show that if $m=2^{k}-1$, then there exists the natural density of integers $n$ such that…

In this paper, we introduce Euclidean Gallai-Ramsey theory, by combining Euclidean Ramsey theory and Gallai-Ramsey theory on graphs. More precisely, we consider the following problem: For an integer $r$ and configurations $K$ and $K'$, does…

For a sequence $M=(m_{i})_{i=0}^{\infty}$ of integers such that $m_{0}=1$, $m_{i}\geq 2$ for $i\geq 1$, let $p_{M}(n)$ denote the number of partitions of $n$ into parts of the form $m_{0}m_{1}\cdots m_{r}$. In this paper we show that for…

We show that for every positive integer $k$ there are positive constants $C$ and $c$ such that if $A$ is a subset of $\{1, 2, \dots, n\}$ of size at least $C n^{1/k}$, then, for some $d \leq k-1$, the set of subset sums of $A$ contains a…

For every $k\ge 2$ and $\Delta$, we prove that there exists a constant $C_{\Delta,k}$ such that the following holds. For every graph $H$ with $\chi(H)=k$ and every tree with at least $C_{\Delta,k}|H|$ vertices and maximum degree at most…

We characterize the computational content and the proof-theoretic strength of a Ramsey-type theorem for bi-colorings of so-called {\em exactly large} sets. An {\it exactly large} set is a set $X\subset\Nat$ such that $\card(X)=\min(X)+1$.…

For two sets $A$ and $M$ of positive integers and for a positive integer $n$, let $p(n,A,M)$ denote the number of partitions of $n$ with parts in $A$ and multiplicities in $M$, that is, the number of representations of $n$ in the form…

Given a pair of $k$-uniform hypergraphs $(G,H)$, the Ramsey number of $(G,H)$, denoted by $R(G,H)$, is the smallest integer $n$ such that in every red/blue-colouring of the edges of $K_n^{(k)}$ there exists a red copy of $G$ or a blue copy…

We study Ramsey's theorem for pairs and two colours in the context of the theory of $\alpha$-large sets introduced by Ketonen and Solovay. We prove that any $2$-colouring of pairs from an $\omega^{300n}$-large set admits an $\omega^n$-large…

We study the finite dimensional partition properties of the countable homogeneous dense local order. Some of our results use ideas borrowed from the partition calculus of the rationals and are obtained thanks to a strengthening of…