English
Related papers

Related papers: Special cases and equivalent forms of Katznelson's…

200 papers

We study the topological recurrence phenomenon of actions of locally compact abelian groups on compact metric spaces. In the case of $\mathbb{Z}^d$-actions we develop new techniques to analyze Bohr recurrence sets. These techniques include…

Dynamical Systems · Mathematics 2024-11-28 Sebastián Donoso , Felipe Hernández , Alejandro Maass

We show that there is a set which is not a set of multiple recurrence despite being a set of recurrence for nil-Bohr sets. This answers Huang, Shao, and Ye's \enquote{higher-order} version of Katznelson's Question on Bohr recurrence and…

Dynamical Systems · Mathematics 2025-12-25 Ryan Alweiss

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…

Dynamical Systems · Mathematics 2014-08-13 Bernard Host , Bryna Kra , Alejandro Maass

We collect problems on recurrence for measure preserving and topological actions of a countable abelian group, considering combinatorial versions of these problems as well. We solve one of these problems by constructing, in…

Dynamical Systems · Mathematics 2017-03-29 John T. Griesmer

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…

Dynamical Systems · Mathematics 2024-12-30 John T. Griesmer

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,…

Dynamical Systems · Mathematics 2012-02-15 Sophie Grivaux , Maria Roginskaya

Motivated by classical problems in extremal graph theory, we study a chromatic analogue of Roth-type questions for linear equations over $\mathbb F_p$. Given a homogeneous equation $\mathcal L:\sum_{i=1}^k c_i x_i=0$ with $k\ge 3$, we study…

Combinatorics · Mathematics 2026-03-06 Hong Liu , Zhuo Wu , Ningyuan Yang , Shengtong Zhang

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…

Dynamical Systems · Mathematics 2024-11-05 Nikos Frantzikinakis , Bernard Host , Bryna Kra

Let $G$ be a compact abelian group and $\phi_1, \phi_2, \phi_3$ be continuous endomorphisms on $G$. Under certain natural assumptions on the $\phi_i$'s, we prove the existence of Bohr sets in the sumset $\phi_1(A) + \phi_2(A) + \phi_3(A)$,…

Combinatorics · Mathematics 2025-09-03 Anh N. Le , Thái Hoàng Lê

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…

Number Theory · Mathematics 2022-05-16 Vitaly Bergelson , Joanna Kułaga-Przymus , Mariusz Lemańczyk , Florian K. Richter

A cornerstone result of Erd\H os, Ginzburg, and Ziv (EGZ) states that any sequence of $2n-1$ elements in $\mathbb{Z}/n$ contains a zero-sum subsequence of length $n$. While algebraic techniques have predominated in deriving many deep…

Katznelson's Question is a long-standing open question concerning recurrence in topological dynamics with strong historical and mathematical ties to open problems in combinatorics and harmonic analysis. In this article, we give a positive…

Dynamical Systems · Mathematics 2023-12-19 Daniel Glasscock , Andreas Koutsogiannis , Florian K. Richter

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,…

Logic · Mathematics 2021-05-28 Stevo Todorčević , Zoltán Vidnyánszky

For a fixed prime $p$, $\mathbb F_{p}$ denotes the field with $p$ elements, and $\mathbb F_{p}^{\omega}$ denotes the countable direct sum $\bigoplus_{n=1}^{\infty} \mathbb F_{p}$. Viewing $\mathbb F_{p}^{\omega}$ as a countable abelian…

Dynamical Systems · Mathematics 2017-11-07 John T. Griesmer

A topological space is reversible if each continuous bijection of it onto itself is open. We introduce an analogue of this notion in the category of topological groups: A topological group G is g-reversible if every continuous automorphism…

Group Theory · Mathematics 2019-12-24 Vitalij Chatyrko , Dmitri Shakhmatov

We prove that any finite abelian group $G$ contains a collection of not too many subsets with a special structure, so that for every subset $A$ of $G$ with a small doubling, there is a member $F$ of the collection that is fully contained in…

Combinatorics · Mathematics 2025-09-03 Noga Alon , Huy Tuan Pham

We prove three results concerning the existence of Bohr sets in threefold sumsets. More precisely, letting $G$ be a countable discrete abelian group and $\phi_1, \phi_2, \phi_3: G \to G$ be commuting endomorphisms whose images have finite…

Combinatorics · Mathematics 2023-06-08 John T. Griesmer , Anh N. Le , Thái Hoàng Lê

A graph $H$ is common if its Ramsey multiplicity, i.e., the minimum number of monochromatic copies of $H$ contained in any $2$-edge-coloring of $K_n$, is asymptotically the same as the number of monochromatic copies in the random…

Combinatorics · Mathematics 2025-09-23 Daniel Kráľ , Matjaž Krnc , Ander Lamaison

We show that any graph polynomial from a wide class of graph polynomials yields a recurrence relation on an infinite class of families of graphs. The recurrence relations we obtain have coefficients which themselves satisfy linear…

Combinatorics · Mathematics 2013-09-17 Tomer Kotek , Johann A. Makowsky

I prove that the Borel directed graphs whose vertex set admits a partition into two Borel acyclic sets form a $\mathbf\Sigma^1_2$-complete set; equivalently, that deciding whether a Borel directed graph has Borel dichromatic number at…

Logic · Mathematics 2026-04-08 Tonatiuh Matos-Wiederhold
‹ Prev 1 2 3 10 Next ›