Count of primitive words

DOI10.1007/S11766-001-0074-3MaRDI QIDQ5952877zbMATH OpenOpenAlexFDO

Authors Lijun Wang

Publication date 27 November 2003

Published in Applied Mathematics. Series B (English Edition) (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s11766-001-0074-3

zbMATH Keywords

exchangeable primitive wordsfinite alphabetprimitive words of given length

Mathematics Subject Classification ID

Combinatorics on words (68R15)

Review text

The author counts the primitive words of given length on a finite alphabet, as well as the ``exchangeable primitive words on a finite alphabet (a word is noexchangeable primitive if the word obtained by applying any permutation to the letters is still primitive). The first result is well known and can be found in any book on combinatorics on words (a nice survey on related topics is for example: \textit{C. Reutenauer} [Mots circulaires et polynômes irréductibles, Ann. Sci. Math. Qué. 12, 275-285 (1988; Zbl 0686.12010)]. The second result in the paper under review is an easy exercise. Note that the results would have been easier to state, had the author known the Möbius function.

Recommendations

• On primitive words
• On primitive words with non-primitive product
• scientific article; zbMATH DE number 2196238
• Abelian-primitive partial words

Cited in

(6)

• On del-robust primitive words
• On primitive words
• Counting Finite Languages by Total Word Length
• scientific article; zbMATH DE number 558591 (Why is no real title available?)
• scientific article; zbMATH DE number 6792663 (Why is no real title available?)
• scientific article; zbMATH DE number 2196238 (Why is no real title available?)

This page was built for publication: Count of primitive words

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5952877)