English

Combinatoric topological string theories and group theory algorithms

High Energy Physics - Theory 2022-10-25 v3 Combinatorics Group Theory Representation Theory

Abstract

A number of finite algorithms for constructing representation theoretic data from group multiplications in a finite group G have recently been shown to be related to amplitudes for combinatoric topological strings (G-CTST) based on Dijkgraaf-Witten theory of flat G-bundles on surfaces. We extend this result to projective representations of G using twisted Dijkgraaf-Witten theory. New algorithms for characters are described, based on handle creation operators and minimal multiplicative generating subspaces for the centers of group algebras and twisted group algebras. Such minimal generating subspaces are of interest in connection with information theoretic aspects of the AdS/CFT correspondence. For the untwisted case, we describe the integrality properties of certain character sums and character power sums which follow from these constructive G-CTST algorithms. These integer sums appear as residues of singularities in G-CTST generating functions. S-duality of the combinatoric topological strings motivates the definition of an inverse handle creation operator in the centers of group algebras and twisted group algebras.

Keywords

Cite

@article{arxiv.2204.02266,
  title  = {Combinatoric topological string theories and group theory algorithms},
  author = {Sanjaye Ramgoolam and Eric Sharpe},
  journal= {arXiv preprint arXiv:2204.02266},
  year   = {2022}
}

Comments

64 pages, LaTeX; v2: typo fixed; v3: reference added

R2 v1 2026-06-24T10:38:37.766Z