Counting Irreducible Double Occurrence Words
Combinatorics
2012-05-01 v1
Abstract
A double occurrence word over a finite alphabet 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.
Keywords
Cite
@article{arxiv.1105.2926,
title = {Counting Irreducible Double Occurrence Words},
author = {Jonathan Burns and Tilahun Muche},
journal= {arXiv preprint arXiv:1105.2926},
year = {2012}
}