2000 character limit reached
Symmetries of Abelian Orbifolds
Published 15 Sep 2010 in hep-th | (1009.3017v1)
Abstract: Using the Polya Enumeration Theorem, we count with particular attention to C3/Gamma up to C6/Gamma, abelian orbifolds in various dimensions which are invariant under cycles of the permutation group S_D. This produces a collection of multiplicative sequences, one for each cycle in the Cycle Index of the permutation group. A multiplicative sequence is controlled by its values on prime numbers and their pure powers. Therefore, we pay particular attention to orbifolds of the form CD/Gamma where the order of Gamma is palpha. We propose a generalization of these sequences for any D and any p.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.