Results 41 to 50 of about 359 (107)
Sturmian theorems for systems of differential equations
International Journal of Mathematics and Mathematical Sciences, Volume 3, Issue 1, Page 177-184, 1980., 1979 Two Sturmian theorems are established for second order linear nonhomogeneous systems of two differential equations with the use of a maximum principle. The results also hold for homogeneous systems. For illustration, an example is given.
C. Y. Chan
wiley +1 more source
Conjugates of characteristic Sturmian words generated by morphisms
, 2004 This article is concerned with characteristic Sturmian words of slope α and 1-α (denoted by cα and c1-α resp.), where α∈(0,1) is an irrational number such that α=[0;1+d1,d2,..., dn] with dn≥d1≥1.
Glen, Amy +3 more
core +1 more source
Comparison theorems for ultrahyperbolic equations
International Journal of Mathematics and Mathematical Sciences, Volume 1, Issue 1, Page 31-40, 1978., 1978 Sturmian comparison theorems are obtained for solutions of a class of normal and singular ultrahyperbolic partial differential equations. In the singular case, solutions are considered which satisfy non‐standard boundary conditions.
C. C. Travis, E. C. Young
wiley +1 more source
Powers in a class of A-strict standard episturmian words
, 2007 This paper concerns a specific class of strict standard episturmian words whose directive words resemble those of characteristic Sturmian words. In particular, we explicitly determine all integer powers occurring in such infinite words, extending recent ...
Glen, Amy, Glen, A.
core +1 more source
Quasiperiodic and Lyndon episturmian words
, 2008 Recently the second two authors characterized quasiperiodic Sturmian words, proving that a Sturmian word is non-quasiperiodic if and only if, it is an infinite Lyndon word.
Amy Glen +8 more
core +1 more source
On the Fibonacci Tiling and its Modern Ramifications
Israel Journal of Chemistry, Volume 64, Issue 10-11, November 2024.Abstract In the last 30 years, the mathematical theory of aperiodic order has developed enormously. Many new tilings and properties have been discovered, few of which are covered or anticipated by the early papers and books. Here, we start from the well‐known Fibonacci chain to explain some of them, with pointers to various generalisations as well as ...
Michael Baake +2 more
wiley +1 more source
A characterization of fine words over a finite alphabet
, 2006 To any infinite word t over a finite alphabet A we can associate two infinite words min (t) and max (t) such that any prefix of min (t) (resp. max (t)) is the lexicographically smallest (resp. greatest) amongst the factors of t of the same length. We say
Glen, Amy, Glen, A.
core +1 more source
Substitutions and their Generalisations
Israel Journal of Chemistry, Volume 64, Issue 10-11, November 2024.Abstract Tilings and point sets arising from substitutions are classical mathematical models of quasicrystals. Their hierarchical structure allows one to obtain concrete answers regarding spectral questions tied to the underlying measures and potentials.
Neil Mañibo
wiley +1 more source
Markoff–Lagrange spectrum of one‐sided shifts
Mathematika, Volume 70, Issue 3, July 2024.Abstract For the Lagrange spectrum and other applications, we determine the smallest accumulation point of binary sequences that are maximal in their shift orbits. This problem is trivial for the lexicographic order, and its solution is the fixed point of a substitution for the alternating lexicographic order.
Hajime Kaneko, Wolfgang Steiner
wiley +1 more source
, 2007 In this paper, we survey the rich theory of infinite episturmian words which generalize to any finite alphabet, in a rather resembling way, the well-known family of Sturmian words on two letters.
Justin, J. +5 more
core +1 more source