Enumeration of mosaics

Harald Fripertinger1

 

Abstract

Mosaics are orbits of partitions arising from music theoretical investigations. Various theorems from the field of "enumeration under finite group actions" are applied for enumerating mosaics. This means, it is demonstrated how to enumerate G-orbits of partitions of given size, block-type or stabilizer-type.
  • Preliminaries
  • Enumeration formulae for mosaics
  • Some numerical results
  • Enumeration by block-type
  • Enumeration formulae for mosaics
  • Some numerical results
  • Enumeration by stabilizer type
  • Some numerical results
  • Some GAP routines
  • Enumeration by block-type and stabilizer type
  • Some numerical results
  • References
  • Address of the author
  • Footnotes

  • harald.fripertinger@kfunigraz.ac.at,
    last changed: January 23, 2001