Abstract
An open problem about finite geometric progressions in syndetic sets leads to a family of diophantine equations related to the commutativity of translation and multiplication by squares.
Similar content being viewed by others
References
Beiglböck, M., Bergelson, V., Hindman, N., Strauss, D.: Multiplicative structures in additively large sets. J. Combin. Theory Ser. A 1137, 1219–1242 (2006)
Glasscock, D., Koutsogiannis, A., Richter, F.K.: Multiplicative combinatorial properties of return time sets in minimal dynamical systems. Discrete Contin. Dyn. Syst. 3910, 5891–5921 (2019)
McNew, N.: Primitive and geometric-progression-free sets without large gaps. Acta Arith. 1921, 95–104 (2020)
Nathanson, M.B., O’Bryant, K.: On sequences without geometric progressions. Integers 13, Paper No. A73, 5 pp. (2013)
Nathanson, M.B., O’Bryant, K.: Irrational numbers associated to sequences without geometric progressions. Integers 14, Paper No. A40, 11 pp. (2014)
Nathanson, M.B., O’Bryant, K.: A problem of Rankin on sets without geometric progressions. Acta Arith. 170(4), 327–342 (2015)
Patil, B.R.: Geometric progressions in syndetic sets. Arch. Math. (Basel) 1132, 157–168 (2019)
Acknowledgements
I wish to thank B.R. Patil for introducing me to this subject at the ICTS Workshop on Additive Combinatorics in Bangalore in March, 2020.
Author information
Authors and Affiliations
Corresponding author
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
This research was supported in part by the International Centre for Theoretical Sciences (ICTS) during a visit for the program—Workshop on Additive Combinatorics (Code: ICTS/Prog-wac2020/02).
Rights and permissions
About this article
Cite this article
Nathanson, M.B. Geometric progressions in syndetic sets. Arch. Math. 115, 413–417 (2020). https://doi.org/10.1007/s00013-020-01488-7
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00013-020-01488-7