Corpus ID: 15355935

Enumeration formul{\ae} in neutral sets

@article{Dolce2015EnumerationFI,
  title={Enumeration formul\{\ae\} in neutral sets},
  author={Francesco Dolce and Dominique Perrin},
  journal={arXiv: Discrete Mathematics},
  year={2015}
}
  • Francesco Dolce, Dominique Perrin
  • Published 2015
  • Mathematics, Computer Science
  • arXiv: Discrete Mathematics
  • We present several enumeration results holding in sets of words called neutral and which satisfy restrictive conditions on the set of possible extensions of nonempty words. These formulae concern return words and bifix codes. They generalize formulae previously known for Sturmian sets or more generally for tree sets. We also give a geometric example of this class of sets, namely the natural coding of some interval exchange transformations. 
    1
    Twitter Mention

    Figures and Topics from this paper.

    Explore Further: Topics Discussed in This Paper

    References

    Publications referenced by this paper.