Related papers: New Obstacles to Multiple Recurrence

Recurrence properties of systems and associated sets of integers that suffice for recurrence are classical objects in topological dynamics. We describe relations between recurrence in different sorts of systems, study ways to formulate…

Let $\alpha_1, \cdots, \alpha_d$ be real numbers, and let $S$ be the set of integers $s$ so that $||\alpha_i s||_{\mathbb{R}/\mathbb{Z}}>\delta$ for some $i$ and some fixed $\delta>0$. We prove $S$ is not \enquote{$2$-large}, i.e. there is…

We make three observations regarding a question popularized by Katznelson: is every subset of $\mathbb Z$ which is a set of Bohr recurrence is also a set of topological recurrence? (i) If $G$ is a countable abelian group and $E\subset G$ is…

We study recurrence and non-recurrence sets for dynamical systems on compact spaces, in particular for products of rotations on the unit circle T. A set of integers is called r-Bohr if it is recurrent for all products of r rotations on T,…

A subset $R$ of integers is a set of Bohr recurrence if every rotation on $\mathbb{T}^d$ returns arbitrarily close to zero under some non-zero multiple of $R$. We show that the set $\{k!\, 2^m3^n\colon k,m,n\in \mathbb{N}\}$ is a set of…

We prove that there is a set of integers $A$ having positive upper Banach density whose difference set $A-A:=\{a-b:a,b\in A\}$ does not contain a Bohr neighborhood of any integer, answering a question asked by Bergelson, Hegyv\'ari, Ruzsa,…

We show that there is no simple (e.g. finite or countable) basis for Borel graphs with infinite Borel chromatic number. In fact, it is proved that the closed subgraphs of the shift graph on $[\mathbb{N}]^{<\mathbb{N}}$ with finite (or,…

We prove that for every infinite set $E\subset \mathbb Z$, there is a set $S\subset E-E$ which is a set of topological recurrence and not a set of measurable recurrence. This extends a result of Igor Kriz, proving that there is a set of…

Let X be a subshift satisfy non-uniform structure. In this paper, we give quantitative estimate of the recurrence sets. These results can be applied to a large class of symbolic systems, including beta-shifts, S-gap shifts and their…

We say that $S\subset\mathbb Z$ is a set of $k$-recurrence if for every measure preserving transformation $T$ of a probability measure space $(X,\mu)$ and every $A\subseteq X$ with $\mu(A)>0$, there is an $n\in S$ such that $\mu(A\cap…

We show that there exists a recursive coloring function $c$ such that any $\Pi^0_3$ set is not a solution to $c$ for Hindman's theorem. We also show that there exists a recursive coloring function $c$ such that any $\Delta^0_3$ set is not a…

We prove that graphs excluding a fixed immersion have bounded nonrepetitive chromatic number. More generally, we prove that if $H$ is a fixed planar graph that has a planar embedding with all the vertices with degree at least 4 on a single…

For every $k\in \mathbb{N}$, we produce a set of integers which is $k$-recurrent but not $(k+1)$-recurrent. This extends a result of Furstenberg who produced a 1-recurrent set which is not 2-recurrent. We discuss a similar result for…

Given a level set $E$ of an arbitrary multiplicative function $f$, we establish, by building on the fundamental work of Frantzikinakis and Host [13,14], a structure theorem which gives a decomposition of $\mathbb{1}_E$ into an almost…

Results concerning recurrence and ergodicity are proved in an abstract Hilbert space setting based on the proof of Khintchine's recurrence theorem for sets, and on the Hilbert space characterization of ergodicity. These results are carried…

Every better quasi-order codifies a Borel graph that does not contain a copy of the shift graph. It is known that there is a better quasi-order that codes a Borel graph with infinite Borel chromatic number, though one has yet to be…

A colouring of a graph is "nonrepetitive" if for every path of even order, the sequence of colours on the first half of the path is different from the sequence of colours on the second half. We show that planar graphs have nonrepetitive…

We show that a finite coloring of an amenable group contains `many' monochromatic sets of the form $\{x,y,xy,yx\},$ and natural extensions with more variables. This gives the first combinatorial proof and extensions of Bergelson and…

This paper describes several new problems and ideas concerning algebraic geometry and complexity theory. It first uses the idea of coloring graphs with elements of finite fields. This procedure then shows that graph coloring problems can be…

We classify the twisted tensor products of a finite set algebra with a two elements set algebra using colored quivers obtained through considerations analogous to Ore extensions. This provides also a classification of entwining structures…