On some properties of accessible sets
A set \(D \subseteq \mathbb{N}\) is called \(r\)-large if every \(r\)-coloring of \(\mathbb{N}\) admits arbitrarily long monochromatic arithmetic progressions \(a,a + d,\ldots ,a + (k-1)d\) with gap \(d\in D\). A set \(D \subseteq \mathbb{N}\) is called \(r\)-accessible if every \(r\)-coloring of \(\mathbb{N}\) admits arbitrarily long monochromatic sequences \(x_1,x_2,\ldots,x_k\) with \(x_{i+1}-x_i\in D\). It is known that if \(D \subseteq \mathbb{N}\) is 2-large, then the gaps between elements in \(D\) cannot grow exponentially. In this paper, the author proves that if \(D\) is 2-accessible, then the gaps between elements in D cannot grow much faster than exponentially. In addition, the author shows that the notion of accessibility is equivalent to that of topological recurrence.
- A set of 2-recurrence whose perfect squares do not form a set of measurable recurrence
- An approximation property of lacunary sequences
- An ergodic IP polynomial Szemerédi theorem
- Avoiding monochromatic sequences with gaps in a fixed translation of the primes
- Avoiding Monochromatic Sequences With Special Gaps
- Chromatic numbers of Cayley graphs on Z and recurrence
- Combinatorial Proofs of the Polynomial van der Waerden Theorem and the Polynomial Hales-Jewett Theorem
- Distance graphs and arithmetic progressions
- Distance graphs with finite chromatic number
- Down the large rabbit hole
- EVEN AND ODD INTEGRAL PARTS OF POWERS OF A REAL NUMBER
- scientific article; zbMATH DE number 6378629 (Why is no real title available?)
- scientific article; zbMATH DE number 5509797 (Why is no real title available?)
- scientific article; zbMATH DE number 5542618 (Why is no real title available?)
- scientific article; zbMATH DE number 1737190 (Why is no real title available?)
- scientific article; zbMATH DE number 850181 (Why is no real title available?)
- Improved Ramsey-type theorems for Fibonacci numbers and other sequences
- Intersective polynomials and the polynomial Szemerédi theorem
- Joint ergodicity of Hardy field sequences
- Large independent sets in shift-invariant graphs
- New bounds on diffsequences
- Numbers contravening a condition in density modulo 1
- On a conjecture of Brown concerning accessible sets
- On the density of sequences \(\{n_k\xi\}\)
- On the distribution of αp modulo 1
- On the fractional parts of lacunary sequences
- On the Set of Common Differences in van der Waerden’s Theorem on Arithmetic Progressions
- Polynomial extensions of van der Waerden’s and Szemerédi’s theorems
- Recurrence, rigidity, and popular differences
- Ruzsa's problem on sets of recurrence
- Sets of \(k\)-recurrence but not \((k+1)\)-recurrence
- Topological dynamics and combinatorial number theory
- Two Erdős problems on lacunary sequences: chromatic number and Diophantine approximation
- Variations on topological recurrence
- Über eine Klasse linearer diophantischer Approximationen.
This page was built for publication: On some properties of accessible sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6941654)
