RECORD
Topological Mixing of Random Substitutions
Dynamical Systems · Submitted 3 Mar 2021
abstract compiled · 2026-09-23 · no language-model review
The authors' main claim For primitive random substitutions on two letters whose second eigenvalue is greater than one in modulus, we identify a simple, computable criterion which is equivalent to topological mixing of the associated subshift.
The compiled record
The paper's own sentences, arranged. Each label is drawn from a closed vocabulary; the number beside it is the probability the classifier gave that label. Numbers in the tables are the authors', checked by code. No sentence in this record was written by a model.
Open the compiled record
The abstract, sentence by sentence
We investigate topological mixing of compatible random substitutions. For primitive random substitutions on two letters whose second eigenvalue is greater than one in modulus, we identify a simple, computable criterion which is equivalent to topological mixing of the associated subshift. This generalises previous results on deterministic substitutions. In the case of recognisable, irreducible Pisot random substitutions, we show that the associated subshift is not topologically mixing. Without recognisability, we rely on more specialised methods for excluding mixing and we apply these methods to show that the random Fibonacci substitution subshift is not topologically mixing.
background contribution method result interpretation main claim
| # | sentence | role | the authors' own work | states the main conclusion | strength |
|---|---|---|---|---|---|
| s0 | We investigate topological mixing of compatible random substitutions. | contribution 0.88 | 0.90 | 0.05 | unclear 0.53 |
| s1 | For primitive random substitutions on two letters whose second eigenvalue is greater than one in modulus, we identify a simple, computable criterion which is equivalent to topological mixing of the associated subshift. | result 0.84 | 0.94 | 0.66 | asserted 1.00 |
| s2 | This generalises previous results on deterministic substitutions. | interpretation 0.74 | 0.59 | 0.06 | asserted 0.99 |
| s3 | In the case of recognisable, irreducible Pisot random substitutions, we show that the associated subshift is not topologically mixing. | result 1.00 | 0.94 | 0.18 | asserted 1.00 |
| s4 | Without recognisability, we rely on more specialised methods for excluding mixing and we apply these methods to show that the random Fibonacci substitution subshift is not topologically mixing. | result 0.74 | 0.94 | 0.11 | asserted 1.00 |
What was examined, and what was not
- arXiv listing abstract v1
- full text
- figures and tables
- references and citing sentences
- relations to other papers
- P abstract
- S sections
- T body sentences
- C citations
- R cross-paper relations
The paper
Original abstract
We investigate topological mixing of compatible random substitutions. For primitive random substitutions on two letters whose second eigenvalue is greater than one in modulus, we identify a simple, computable criterion which is equivalent to topological mixing of the associated subshift. This generalises previous results on deterministic substitutions. In the case of recognisable, irreducible Pisot random substitutions, we show that the associated subshift is not topologically mixing. Without recognisability, we rely on more specialised methods for excluding mixing and we apply these methods to show that the random Fibonacci substitution subshift is not topologically mixing.
Human review
How the literature uses it
1 arXiv paper cite this in 1 sentence
Discussion
Know something about this paper? Leave a comment, or highlight any passage above to comment on it.