Special cases and equivalent forms of Katznelson's problem on recurrence (Q2679709)

From MaRDI portal
Revision as of 21:09, 13 February 2024 by RedirectionBot (talk | contribs) (‎Changed an Item)
scientific article
Language Label Description Also known as
English
Special cases and equivalent forms of Katznelson's problem on recurrence
scientific article

    Statements

    Special cases and equivalent forms of Katznelson's problem on recurrence (English)
    0 references
    23 January 2023
    0 references
    In this paper, the author deals with a problem raised by \textit{Y. Katznelson} in [Combinatorica 21, No. 2, 211--219 (2001; Zbl 0981.05038)]. The basic motivation of this work is a couple of conjectures: {Conjecture 1.} Let \(G\) be a countable infinite abelian group. If \(S\subseteq G\) is a set of Bohr recurrence, then \(S\) is a set of chromatic recurrence. {Conjecture 2.} If \(S\subseteq \Delta_2(\mathcal{E}_1)\) is a set of Bohr recurrence in \(\mathbb{Z}^\omega\), then \(S\) is a set of chromatic recurrence. Here, for a subset of \(G\), we write \(\Delta_2(A)\) for the set \(\{(a - b) - (c - d) : a, b, c, d \in A \text{\, are mutually distinct}\}\), \(\mathcal{E}_1\) for \(\{e_j : j \in \mathbb{N}\}\), while \(\mathbb{Z}^\omega\) denotes the direct sum of countably many copies of \(\mathbb{Z}\) with the usual presentation: elements of \(\mathbb{Z}^\omega\) are sequences \((n_1, n_2, n_3, \dots)\) of integers where \(n_j = 0\) for all but finitely many \(j\). The main results in this paper are: (1) Let \(G\) be a countable abelian group and \(E\subseteq G\) be an \(I_0\) set ( \(E\) is an \(I_0\) set if for every bounded \(f : E \to \mathbb{C}\), there is an almost periodic \(\psi : G \to \mathbb{C}\) such that \(\psi |_{E} = f\)). If \(S\subseteq E-E\) is a set of Bohr recurrence, then \(S\) is a set of chromatic recurrence; (2) Conjecture 2 implies Conjecture 1.
    0 references
    topological abelian group
    0 references
    recurrence
    0 references
    Bohr topology
    0 references
    difference set
    0 references
    0 references

    Identifiers