English
Related papers

Related papers: On long arithmetic progressions in binary Morse-li…

200 papers

Suppose that we have a finite colouring of the reals. What sumset-type structures can we hope to find in some colour class? One of our aims is to show that there is such a colouring for which no uncountable set has all of its pairwise sums…

Combinatorics · Mathematics 2015-10-21 Neil Hindman , Imre Leader , Dona Strauss

Given a countable set X (usually taken to be the natural numbers or integers), an infinite permutation, \pi, of X is a linear ordering of X. This paper investigates the combinatorial complexity of infinite permutations on the natural…

Discrete Mathematics · Computer Science 2011-08-19 Steven Widmer

We show that if besides the primes some other sequences (involving the Liouville function and the primes) have a common distribution level exceeding 0.7231 then for any positive even integer $h$ there are arbitrarily long arithmetic…

Number Theory · Mathematics 2010-04-08 Janos Pintz

We give an equivalent form of the Twin prime conjecture relating to a symmetric property that is observed for terms present in a certain sequence of arithmetic progressions defined for a pair of co-prime integers.

Number Theory · Mathematics 2026-03-10 Srikanth Cherukupally

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

Extending Furstenberg's ergodic theoretic proof for Szemer\'edi's theorem on arithmetic progressions, Furstenberg and Weiss (2003) proved the following qualitative result. For every d and k, there exists an integer N such that no matter how…

Combinatorics · Mathematics 2013-09-13 János Pach , József Solymosi , Gábor Tardos

The celebrated Green-Tao theorem states that the prime numbers contain arbitrarily long arithmetic progressions. We give an exposition of the proof, incorporating several simplifications that have been discovered since the original paper.

Number Theory · Mathematics 2018-03-06 David Conlon , Jacob Fox , Yufei Zhao

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

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…

Combinatorics · Mathematics 2014-03-26 Aldo de Luca , Elena V. Pribavkina , Luca Q. Zamboni

We develop an algebraic language theory based on the notion of an Eilenberg--Moore algebra. In comparison to previous such frameworks the main contribution is the support for algebras with infinitely many sorts and the connection to logic…

Formal Languages and Automata Theory · Computer Science 2023-06-22 Achim Blumensath

We prove explicit upper bounds for weighted sums over prime numbers in arithmetic progressions with slowly varying weight functions. The results generalize the well-known Brun-Titchmarsh inequality.

Number Theory · Mathematics 2015-11-09 Jan Büthe

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

The Thue--Morse sequence is a prototypical automatic sequence found in diverse areas of mathematics, and in computer science. We study occurrences of factors $w$ within this sequence, more precisely, the sequence of gaps between consecutive…

Combinatorics · Mathematics 2021-11-19 Lukas Spiegelhofer

We describe a technique for mechanically proving certain kinds of theorems in combinatorics on words, using automata and a package for manipulating them. We illustrate our technique by solving, purely mechanically, an open problem of Currie…

Formal Languages and Automata Theory · Computer Science 2012-03-30 Dane Henshall , Jeffrey Shallit

The Thue--Morse sequence $t=01101001\cdots$ is an automatic sequence over the alphabet $\{0,1\}$. It can be defined as the binary sum-of-digits function $s:\mathbb N\rightarrow\mathbb N$, reduced modulo $2$, or by using the substitution…

Number Theory · Mathematics 2023-09-11 Lukas Spiegelhofer

Van der Waerden's (VDW) colouring theorem in combinatoric number theory [1] has scope for physical applications.The solution of the two colour case has enabled the construction of an explicit mapping of an infinite, one dimensional…

Condensed Matter · Physics 2007-05-23 Debashis Gangopadhyay , Ranjan Chaudhury

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

We exhibit infinite families of planar graphs with real chromatic roots arbitrarily close to 4, thus resolving a long-standing conjecture in the affirmative.

Combinatorics · Mathematics 2009-09-29 Gordon F. Royle

We show that for any finite coloring of the group $\mathbb{Z}_2 *\mathbb{Z}_2 *\mathbb{Z}_2$ and for any positive integer $k$, there always exists a monochromatic regular $k$-gon in $\mathbb{Z}_2 *\mathbb{Z}_2 *\mathbb{Z}_2$ with respect to…

Combinatorics · Mathematics 2018-07-26 Hui Xu , Enhui Shi

We extend some classical results - such as Quillen's Theorem A, the Grothendieck construction, Thomason's Theorem and the characterisation of homotopically cofinal functors - from the homotopy theory of small categories to polynomial monads…

Algebraic Topology · Mathematics 2020-01-16 Michael Batanin , Florian De Leger