In mathematics, a Sturmian word (Sturmian sequence or billiard sequence), named after Jacques Charles François Sturm, is a certain kind of infinitely...
14 KB (1,939 words) - 17:45, 11 January 2024
addition. It is a paradigmatic example of a Sturmian word and specifically, a morphic word. The name "Fibonacci word" has also been used to refer to the members...
14 KB (1,938 words) - 18:07, 23 August 2024
In mathematics, a Sturmian sequence may refer to: A Sturmian word: a sequence with minimal complexity function A sequence used to determine the number...
244 bytes (66 words) - 17:57, 10 February 2011
another name for eigenvector of a matrix Characteristic word, a subclass of Sturmian word Euler characteristic, a topological invariant Method of characteristics...
2 KB (260 words) - 23:38, 4 October 2024
"compact variant" It is conjectured that the Fibonacci word fractal appears for every sturmian word for which the slope, written in continued fraction expansion...
9 KB (1,098 words) - 15:36, 23 August 2023
different irrational number. Beatty sequences can also be used to generate Sturmian words. Any irrational number r {\displaystyle r} that is greater than one...
13 KB (2,174 words) - 04:50, 31 July 2023
Complexity function (redirect from Balanced word)
complexity function at most n+1. A Sturmian word over a binary alphabet is one with complexity function n + 1. A sequence is Sturmian if and only if it is balanced...
10 KB (1,313 words) - 02:57, 21 January 2023
word, a sequence such that any factor (consecutive subsequence) that appears does so infinitely often, such as the Thue–Morse sequence or a Sturmian word...
302 bytes (71 words) - 20:05, 28 October 2012
number for which the digits with respect to some fixed base form a Sturmian word. The Prouhet–Thue–Morse constant and the related rabbit constant. The...
51 KB (6,722 words) - 14:57, 11 November 2024
the Lyndon words. Lexicographically minimal string rotation Morphic word Sturmian word Necklace (combinatorics) Lyndon (1954). Shirshov (1953). Berstel &...
21 KB (2,749 words) - 01:18, 7 August 2024
where z is a letter not in A. Cutting sequence Lyndon word Hall word Sturmian word Lothaire (2005) p.524 Lothaire (2011) p. 10 Honkala (2010) p.505 Lothaire...
6 KB (664 words) - 11:54, 11 December 2021
individual grid lines crossed ("cut") as a curve crosses a square grid. Sturmian words are a special case of cutting sequences where the curves are straight...
2 KB (120 words) - 07:45, 28 May 2023
al. (2004) Synchronisation of a resonant tunneling diode oscillators Sturmian word Arnol'd, V.I. (1961). "Small denominators. I. Mapping the circle onto...
21 KB (3,177 words) - 02:28, 21 March 2024
Combinatorics on words (redirect from Word combinatorics)
equivalent definitions of Sturmian words. For example, an infinite word is Sturmian if and only if it has n + 1 {\displaystyle n+1} distinct factors of...
20 KB (2,588 words) - 13:09, 27 September 2024
are always at most three different intervals separating the tones. A Sturmian word is infinite sequences of two symbols (for instance, "H" and "V") describing...
25 KB (3,000 words) - 03:54, 15 March 2024
Chiara; Mignosi, Filippo; Shallit, Jeffrey; Venturini, Ilaria (2004), "Sturmian graphs and a conjecture of Moser", in Calude, Cristian S.; Calude, Elena;...
8 KB (968 words) - 21:15, 26 October 2024
periodic (meaning periodic after some nonperiodic initial segment). All Sturmian words are uniformly recurrent. Lothaire (2011) p. 30 Allouche & Shallit...
4 KB (423 words) - 05:34, 13 May 2024
Mohammad-Noori, M.; Currie, James D. (2007), "Dejean's conjecture and Sturmian words", European Journal of Combinatorics, 28 (3): 876–890, doi:10.1016/j...
7 KB (938 words) - 09:42, 18 August 2023
of real numbers encoded by lines of tiles (the encoding is related to Sturmian sequences made as the differences of consecutive elements of Beatty sequences)...
29 KB (3,456 words) - 06:49, 22 October 2024