Counting irreducible double occurrence words

MaRDI QIDQ3110132zbMATH OpenFDO

Authors Jonathan Burns, Tilahun Muche

Publication date 26 January 2012

Full work available at URL https://arxiv.org/abs/1105.2926

zbMATH Keywords

countingdouble occurrence wordsenumerating of words

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Exact enumeration problems, generating functions (05A15)

Abstract: A double occurrence word $w$ over a finite alphabet $Sigma$ is a word in which each alphabet letter appears exactly twice. Such words arise naturally in the study of topology, graph theory, and combinatorics. Recently, double occurrence words have been used for studying DNA recombination events. We develop formulas for counting and enumerating several elementary classes of double occurrence words such as palindromic, irreducible, and strongly-irreducible words.

Recommendations

• Reductions on Double Occurrence Words
• Double occurrence words: their graphs and matrices
• Symbol Separation in Double Occurrence Words
• Insertions yielding equivalent double occurrence words
• Enumeration of irreducible binary words

Cited in

(6)

• Double occurrence words: their graphs and matrices
• scientific article; zbMATH DE number 554160 (Why is no real title available?)
• Insertions yielding equivalent double occurrence words
• Reductions on Double Occurrence Words
• scientific article; zbMATH DE number 6322907 (Why is no real title available?)
• Symbol Separation in Double Occurrence Words

This page was built for publication: Counting irreducible double occurrence words

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