Results 31 to 40 of about 1,338,709 (133)
Conjugates of characteristic Sturmian words generated by morphisms [PDF]
, 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
Journal of High Energy Physics, 2018 Permutations and associated algebras allow the construction of half and quarter BPS operators in maximally supersymmetric Yang Mills theory with U(N), SO(N) and Sp(N) gauge groups.
Christopher Lewis-Brown +1 more
doaj +1 more source
Generalized Lyndon Factorizations of Infinite Words [PDF]
Theoretical Computer Science, 2019 14 pages, 1 ...
Amanda Burcroff, Eric Winsor
openaire +3 more sources
Powers in a class of A-strict standard episturmian words [PDF]
, 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
Occurrences of palindromes in characteristic Sturmian words [PDF]
, 2006 This paper is concerned with palindromes occurring in characteristic Sturmian words cα of slope α, where α∈(0,1) is an irrational. As cα is a uniformly recurrent infinite word, any (palindromic) factor of cα occurs infinitely many times in cα with ...
Glen, Amy, Glen, Amy Louise, Glen, A.
core +1 more source
No Animals Were Harmed in the Making of this Veal
Voices in Bioethics, 2016 I was raised on a conventional Jewish-American meat- and potato-based diet during my first two decades. In response to an emerging awareness of health risks related to my typical fare and exposure to alternative diets and, occasionally, the philosophies ...
Edward Weisberg
doaj +1 more source
On the local-indicability cohen–lyndon theorem
, 2011 For a group H and a subset X of H, we let HX denote the set {hxh?1 | h ? H, x ? X}, and when X is a free-generating set of H, we say that the set HX is a Whitehead subset of H. For a group F and an element r of F, we say that r is Cohen–Lyndon aspherical
Antolin, Yago +5 more
core +1 more source
Lyndon Words and Short Superstrings [PDF]
Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, 2013 In the Shortest-Superstring problem, we are given a set of strings S and want to find a string that contains all strings in S as substrings and has minimum length. This is a classical problem in approximation and the best known approximation factor is 2 1/2, given by Sweedyk in 1999.
openaire +3 more sources
Order and quasiperiodicity in episturmian words [PDF]
, 2007 We prove a refinement of a recent characterization of infinite episturmian words via lexicographic orderings (Glen-Justin-Pirillo, 2007). This allows us to easily characterize the strict episturmian words that are "infinite Lyndon words", i.e., those ...
Glen, A.
core
Lyndon words, permutations and trees
Theoretical Computer Science, 2003 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Christophe Hohlweg +1 more
openaire +2 more sources