English
Related papers

Related papers: Monochromatic Polynomial sumset structures on $\ma…

200 papers

We show that for all $\ell$ and $\epsilon>0$ there is a constant $c=c(\ell,\epsilon)>0$ such that every $\ell$-coloring of the triples of an $N$-element set contains a subset $S$ of size $c\sqrt{\log N}$ such that at least $1-\epsilon$…

Combinatorics · Mathematics 2009-01-27 David Conlon , Jacob Fox , Benny Sudakov

For any countably infinite graph $G$, Ramsey's theorem guarantees an infinite monochromatic copy of $G$ in any $r$-coloring of the edges of the countably infinite complete graph $K_\mathbb{N}$. Taking this a step further, it is natural to…

Combinatorics · Mathematics 2018-08-16 Louis DeBiasio , Paul McKenney

We prove that a sumset of a TE subset of (\N) (these sets can be viewed as "aperiodic" sets) with a set of positive upper density intersects a set of values of any polynomial with integer coefficients., i.e. for any (A \subset \N ) a TE…

Dynamical Systems · Mathematics 2007-11-21 A. Fish

For each finite poset $F$ with $|F| > 1$, $\chi_{ac}(F)$ denotes the smallest integer $n$ (if it exists) such that the elements of every finite poset $P$ with $|P| > 1$ can be coloured with at most $n$ colours so that every maximal $F$-free…

Combinatorics · Mathematics 2024-03-12 Bill Sands

We give a short, explicit proof of Hindman's Theorem that in every finite coloring of the integers, there is an infinite set all of whose finite sums have the same color. We give several exampls of colorings of the integers which do not…

Combinatorics · Mathematics 2011-07-05 Henry Towsner

Given a natural $n$, we construct a two-coloring of $\mathbb{R}^n$ with the maximum metric satisfying the following. For any finite set of reals $S$ with diameter greater than $5^{n}$ such that the distance between any two consecutive…

Metric Geometry · Mathematics 2023-07-26 Valeriya Kirova , Arsenii Sagdeev

J. Makowsky and B. Zilber (2004) showed that many variations of graph colorings, called CP-colorings in the sequel, give rise to graph polynomials. This is true in particular for harmonious colorings, convex colorings, mcc_t-colorings, and…

Combinatorics · Mathematics 2017-01-25 A. Goodall , M. Hermann , T. Kotek , J. A. Makowsky , S. D. Noble

We prove a canonical polynomial Van der Waerden's Theorem. More precisely, we show the following. Let $\{p_1(x),\ldots,p_k(x)\}$ be a set of polynomials such that $p_i(x)\in \mathbb{Z}[x]$ and $p_i(0)=0$, for every $i\in \{1,\ldots,k\}$.…

Combinatorics · Mathematics 2020-04-17 António Girão

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…

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

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

We introduce the notion of a coherent $P$-ultrafilter on a complete ccc Boolean algebra, strenghtening the notion of a $P$-point on $\omega$, and show that these ultrafilters exist generically under ${\mathfrak c} = {\mathfrak d}$. This…

General Topology · Mathematics 2015-06-04 Jan Starý

We prove an old conjecture of Erd{\H o}s and Graham on sums of unit fractions: There exists a constant $b>0$ such that if we $r$-color the integers in $2,b^r]$, then there exists a monochromatic set $S$ such that $\sum_{n \in S} 1/n=1$.

Number Theory · Mathematics 2007-05-23 Ernest S. Croot

Let $F$ be an integral linear recurrence, $G$ be an integer-valued polynomial splitting over the rationals, and $h$ be a positive integer. Also, let $\mathcal{A}_{F,G,h}$ be the set of all natural numbers $n$ such that $\gcd(F(n), G(n)) =…

Number Theory · Mathematics 2020-12-15 Daniele Mastrostefano , Carlo Sanna

Fern\'andez-Bret\'on, Sarmiento and Vera showed that whenever a direct sum of sufficiently many copies of ${\mathbb Z}_4$, the cyclic group of order 4, is countably coloured there are arbitrarily large finite sets $X$ whose sumsets $X+X$…

Combinatorics · Mathematics 2024-07-08 Imre Leader , Kada Williams

The Dense Hindman's Theorem states that, in any finite coloring of the integers, one may find a single color and a "dense" set $B_1$, for each $b_1\in B_1$ a "dense" set $B_2^{b_1}$ (depending on $b_1$), for each $b_2\in B_2^{b_1}$ a…

Combinatorics · Mathematics 2012-12-03 Henry Towsner

Selective ultrafilters are characterized by many equivalent properties, in particular the Ramsey property that every finite colouring of unordered pairs of integers has a homogeneous set in U, and the equivalent property that every function…

Logic · Mathematics 2011-06-09 Marco Forti

In [9], [15] it has been introduced a technique, based on nonstandard analysis, to study some problems in combinatorial number theory. In this paper we present three applications of this technique: the first one is a new proof of a known…

Logic · Mathematics 2014-01-22 Lorenzo Luperi Baglini

Let $k$ be a number field with algebraic closure $\bar{k}$, and let $S$ be a finite set of places of $k$ containing all the archimedean ones. Fix $d\geq 2$ and $\alpha \in \bar{k}$ such that the map $z\mapsto z^d+\alpha$ is not…

Number Theory · Mathematics 2020-11-02 Robert L. Benedetto , Su-Ion Ih

Let D be the open unit disc in C. The paper deals with the following conjecture: If f is a continuous function on bD such that the change of argument of Pf+1 around bD is nonnegative for every polynomial P such that Pf+1 has no zero on bD…

Complex Variables · Mathematics 2012-02-09 Josip Globevnik