Matrix realizations of pairs of Young tableaux, keys and shuffles.
Azenhas, Olga, Mamede, Ricardo (2004)
Séminaire Lotharingien de Combinatoire [electronic only]
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Displaying similar documents to “Words and repeated factors.”
Matrix realizations of pairs of Young tableaux, keys and shuffles.
Complete description of substitutions in cylindric algebras and other algebraic logics
Richard Thompson (1993)
Banach Center Publications
Similarity:
On the permutations generated by Sturmian words.
Makarov, M.A. (2009)
Sibirskij Matematicheskij Zhurnal
Similarity:
Actions of the symmetric group generated by comparable sets of integers and Smith invariants.
Azenhas, Olga, Mamede, Ricardo (2007)
Séminaire Lotharingien de Combinatoire [electronic only]
Similarity:
Complexity of testing morphic primitivity
Štěpán Holub, Vojtěch Matocha (2013)
Kybernetika
Similarity:
We analyze an algorithm that decides whether a given word is a fixed point of a nontrivial morphism. We show that it can be implemented to have complexity in , where is the length of the word and the size of the alphabet.
Factor frequencies in generalized Thue-Morse words
Ľubomíra Balková (2012)
Kybernetika
Similarity:
We describe factor frequencies of the generalized Thue-Morse word defined for , as the fixed point starting in of the morphism where and where the letters are expressed modulo . We use the result of Frid [4] and the study of generalized Thue-Morse words by Starosta [6].
On a connection between the word problem and decidability of the equational theory.
Popov, V.Yu. (2000)
Siberian Mathematical Journal
Similarity:
Lengths of involutions in Coxeter groups.
Perkins, Sarah B., Rowley, Peter J. (2004)
Journal of Lie Theory
Similarity:
Restricted 123-involutions.
Guibert, O., Mansour, Toufik (2002)
Séminaire Lotharingien de Combinatoire [electronic only]
Similarity: