Papers
Topics
Authors
Recent
Search
2000 character limit reached

Combinatoric topological string theories and group theory algorithms

Published 5 Apr 2022 in hep-th, math.CO, math.GR, and math.RT | (2204.02266v3)

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.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (2)

Collections

Sign up for free to add this paper to one or more collections.