1987
DOI: 10.1007/bfb0081890
|View full text |Cite
|
Sign up to set email alerts
|

Substitution Dynamical Systems-Spectral Analysis

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

6
558
0
22

Year Published

1994
1994
2018
2018

Publication Types

Select...
6
2
1

Relationship

0
9

Authors

Journals

citations
Cited by 588 publications
(595 citation statements)
references
References 0 publications
6
558
0
22
Order By: Relevance
“…The most spectacular result was given in the case of a discretized Laplacian with a potential taking on finitely many values (called letters): in such a case the set of gap labels is the Z-module generated by the occurrence probability of all possible finite words found in the sequence defined by the potential. If this sequence is given by a substitution, these occurrence probabilities can be computed explicitely in terms of the incidence matrix of the substitution and of the associated substitution induced on the set of words with two letters [58,9]. The key property in proving such results was the use of the Pimsner-Voiculescu exact sequence [55].…”
Section: Historic Backgroundmentioning
confidence: 99%
“…The most spectacular result was given in the case of a discretized Laplacian with a potential taking on finitely many values (called letters): in such a case the set of gap labels is the Z-module generated by the occurrence probability of all possible finite words found in the sequence defined by the potential. If this sequence is given by a substitution, these occurrence probabilities can be computed explicitely in terms of the incidence matrix of the substitution and of the associated substitution induced on the set of words with two letters [58,9]. The key property in proving such results was the use of the Pimsner-Voiculescu exact sequence [55].…”
Section: Historic Backgroundmentioning
confidence: 99%
“…In order to answer this question, we recall now a useful construction which can be found in [21]. Let [12] (Theorem 30).…”
Section: The S( (N) Functionsmentioning
confidence: 99%
“…With any symbolic sequence u defined over a finite set, one can also associate the dynamical system (O(u), T), where 0(u) is [18]), that the order of magnitude of the functions ON (u) [21] (ii) ~82 = 1, ~x2 = 0, 02 is a root of unity and Aa,u = 0.…”
mentioning
confidence: 99%
“…In this paper, the two-symbol substitutional sequence used is the RS sequence. RS sequences are two-symbol aperiodic sequences with random-like character [20][21][22]. In its basic form, an RS sequence is first generated from the two-symbol alphabet {−1, 1} via the simple recursive rule…”
Section: Background and Problem Formulationsmentioning
confidence: 99%