Distinguishing sets of strong recurrence from van der Corput sets

DOI10.1007/S11856-024-2644-7MaRDI QIDQ6660129zbMATH OpenFDO

Authors Andreas Mountakis

Publication date 10 January 2025

Published in Israel Journal of Mathematics (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/S11856-024-2644-7

Mathematics Subject Classification ID

Sequences and sets (11Bxx) Probabilistic theory: distribution modulo (1); metric theory of algorithms (11Kxx) Measure-theoretic ergodic theory (28Dxx)

Cites work

• Diophantische Ungleichungen. I: Zur Gleichverteilung modulo Eins
• scientific article; zbMATH DE number 3912488 (Why is no real title available?)
• scientific article; zbMATH DE number 3271087 (Why is no real title available?)
• Ruzsa's problem on sets of recurrence
• The construction of a set of recurrence which is not a set of strong recurrence
• Van der Corput sets in Z^d
• Van der Corput's difference theorem

Cited in

(1)

• Separating topological recurrence from measurable recurrence: exposition and extension of Kriz's example

This page was built for publication: Distinguishing sets of strong recurrence from van der Corput sets

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