Access the full text.
Sign up today, get DeepDyve free for 14 days.
Loading next page...
/lp/springer_journal/on-word-equations-originated-from-discrete-dynamical-systems-related-BXr8T1rOaz
References (10)
-
Wanji Dai, Kebo Lü, Jun Wang (2008)
Combinatorics on words in symbolic dynamics: The quadratic mapActa Mathematica Sinica, English Series, 24
-
Elias Abboud (2008)
Algorithms for Producing and Ordering Lexical and Nonlexical Sequences out of One ElementAnnals of Combinatorics, 15
-
William Chen, J. Louck, Jun Wang (2000)
Adjacency and Parity Relations of Words in Discrete Dynamical SystemsJ. Comb. Theory, Ser. A, 91
-
Ke-bo Lu (2013)
Some combinatorial properties of words in discrete dynamical systems from antisymmetric cubic mapsActa Mathematica Sinica, English Series, 29
-
William Chen, J. Louck (1997)
Necklaces, MSS Sequences, and DNA SequencesAdvances in Applied Mathematics, 18
-
(1987)
MSS sequences, coloring of necklaces, and periodic points of f(z) = z2 − 2 -
Wanji Dai, Kebo Lü, Jun Wang (2008)
Combinatorics on words in symbolic dynamics: the antisymmetric cubic mapActa Mathematica Sinica, English Series, 24
-
M. Lothaire (1983)
Combinatorics on Words, Encyclopedia of Mathematics and Its Applications -
William Chen, Jun Wang (2001)
Decomposition of NecklacesAnnals of Combinatorics, 5
-
Sun Lichiang, G. Helmberg (1988)
Maximal words connected with unimodal mapsOrder, 4
- Publisher
- Springer Journals
- Copyright
- Copyright © 2018 by Institute of Mathematics, Academy of Mathematics and Systems Science, Chinese Academy of Sciences, Chinese Mathematical Society and Springer-Verlag GmbH Germany, part of Springer Nature
- Subject
- Mathematics; Mathematics, general
- ISSN
- 1439-8516
- eISSN
- 1439-7617
- DOI
- 10.1007/s10114-018-6485-3
- Publisher site
- See Article on Publisher Site
Abstract
In this article, we solve some word equations originated from discrete dynamical systems related to antisymmetric cubic map. These equations emerge when we work with primitive and greatest words. In particular, we characterize all the cases for which $$ < {\beta _1}{\bar \beta _1} > = < {\beta _2}{\bar \beta _2} > $$ < β 1 β ¯ 1 > = < β 2 β ¯ 2 > where β 1 and β 2 are the greatest words in ≪β 1≫ and ≪β 2≫ of M(n).
Journal
Acta Mathematica Sinica, English Series – Springer Journals
Published: May 7, 2018