2021
DOI: 10.1017/s1446788721000215
|View full text |Cite
|
Sign up to set email alerts
|

On Higher Dimensional Arithmetic Progressions in Meyer Sets

Abstract: In this paper we study the existence of higher dimensional arithmetic progressions in Meyer sets. We show that the case when the ratios are linearly dependent over ${\mathbb Z}$ is trivial and focus on arithmetic progressions for which the ratios are linearly independent. Given a Meyer set $\Lambda $ and a fully Euclidean model set with the property that finitely many translates of cover $\Lambda $ … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2022
2022
2024
2024

Publication Types

Select...
3

Relationship

0
3

Authors

Journals

citations
Cited by 3 publications
(1 citation statement)
references
References 21 publications
0
1
0
Order By: Relevance
“…In [5], Avgustinovich and Frid show that any binary word occurs as an arithmetic subsequence of the Thue-Morse sequence (or more generally, a fixed point of any primitive bijective binary constant-length substitution), and go on to investigate properties of the arithmetic complexity of certain words over arbitrary finite alphabets. If we instead consider monochromatic arithmetic subsequences of a given substitutive word and fix the difference of the arithmetic progressions, we note that the length is bounded in the case of the Thue-Morse and more general Thue-Morse-like sequences, as shown, respectively, in [33] and, by the present authors, in [2]; see also [27,28] for results regarding arithmetic progressions in model sets.…”
Section: Introductionmentioning
confidence: 59%
“…In [5], Avgustinovich and Frid show that any binary word occurs as an arithmetic subsequence of the Thue-Morse sequence (or more generally, a fixed point of any primitive bijective binary constant-length substitution), and go on to investigate properties of the arithmetic complexity of certain words over arbitrary finite alphabets. If we instead consider monochromatic arithmetic subsequences of a given substitutive word and fix the difference of the arithmetic progressions, we note that the length is bounded in the case of the Thue-Morse and more general Thue-Morse-like sequences, as shown, respectively, in [33] and, by the present authors, in [2]; see also [27,28] for results regarding arithmetic progressions in model sets.…”
Section: Introductionmentioning
confidence: 59%