On multiplicative recurrence along linear patterns

From MaRDI portal





Recently, \textit{S. Donoso} et al. [J. Anal. Math. 149, No. 2, 719--761 (2023; Zbl 1522.37065)] studied sets of recurrence, in both measurable and topological settings, for actions of \((\mathbb{N}, \times)\) and \((\mathbb{Q}_{>0}, \times)\). In particular, they showed that sets of the form\N\[\NS:=\left\{\frac{an+b}{cn+d} : n\in\mathbb{N}\right\}\N\]\Nare sets of topological multiplicative recurrence if \(a=c\), and \(a\mid b\) or \(a\mid d\). They also posed this question: for \(a\in \mathbb{N}\), \(b,d \in \mathbb{Z}\), is it true that the above set \(S\) is a set of topological multiplicative recurrence if and only if \(a \mid b\) or \(a\mid d\)? It can be shown that for \(a,c \in \mathbb{N}\) and \(b,d \in \mathbb{Z}\), if the above set \(S\) is a set of topological multiplicative recurrence, then for any completely multiplicative function \(f: \mathbb{N} \to \mathbb{S}^1\),\N\[\N\liminf_{n\to \infty} |f(an+b)-f(cn+d)|=0,\N\]\Nwhere \(\mathbb{S}^1\) denotes the set of complex numbers with modulus \(1\). In the present paper, the authors consider the above question by studying conditions that this \(\liminf\) relation holds. More precisely, letting \(\mathcal{M}\) to be the set of all completely multiplicative functions \(f: \mathbb{N} \to \mathbb{S}^1\), they prove that for \(a,c \in \mathbb{N}\) and \(b,d \in \mathbb{Z}\) with \(\gcd(a,b,c,d)=1\), the following are equivalent:\N\N(i) For every \(f\in \mathcal{M}\) and \(\varepsilon>0\), the set \( \{n\in \mathbb{N} : |f(an+b)-f(cn+d)| < \varepsilon\}\) has positive upper logarithmic density.\N\N(ii) For every \(f\in\mathcal{M}\), \(\liminf_{n\to \infty} | f(an+b) - f(cn+d)| =0\).\N\N(iii) \(a=c\), and \(b=d\) or \(a\mid bd\).\N\NRegarding to the pairs of multiplicative functions, they show that for any \(a\in \mathbb{N}\), \(f,g \in \mathcal{M}\) and \(\varepsilon>0\), the set \(\{n\in \mathbb{N} : |f(an+1)-g(an)| < \varepsilon \}\) has positive upper logarithmic density, and consequently, \(\liminf_{n\to \infty} |f(an+1)-g(an) |=0\). Furthermore, the authors prove that for \(a\in \mathbb{N}\) and \(b,d \in \mathbb{Z}\) with \(\gcd(a,b,d)=1\) satisfy \(b=d\) or \(a\mid bd\), the set \(S\), defined in the above, is a set of multiplicative recurrence for all finitely generated multiplicative systems. The proof of the main theorem relies on the recently developed \(Q\)-trick, due to \textit{N. Frantzikinakis} et al. [Forum Math. Pi 13, Paper No. e5, 52 p. (2025; Zbl 1558.05134)].



Cites work









This page was built for publication: On multiplicative recurrence along linear patterns

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6917914)