combinat::lyndonWords – Lyndon words

combinat::lyndonWords provides functions for counting, generating, and manipulating necklaces Lyndon words.

Further functions are documented theme by theme in separate help pages:

• Lyndon words with prescribed evaluation combinat::lyndonWords::fromEvaluation,

• Lyndon words with prescribed content: combinat::lyndonWords::fromContent.

Superdomain

Dom::BaseDomain

Categories

Cat::CombinatorialClass

Axioms

Ax::systemRep

Related Domains:

combinat::necklaces

Details:

• A Lyndon word is an aperiodic necklace (see combinat::necklaces), that is an aperiodic word, considered up to a cyclic rotation. For example, [2,1,3,1], [1,3,1,2], [3,1,2,1], and [1,2,1,3] all represent the same Lyndon word, but [1,2,1,2] is not a Lyndon word.

• If the letters (or beads) of a Lyndon word can be ordered then, by convention, its canonical representative is the lexicographically smallest element in its equivalence class. In the example above, that would be [1,2,1,3].

Entries

Changes in MuPAD 3.1

New Function.