2000 character limit reached
A universal state sum
Published 5 Apr 2021 in math.QA and math.GT | (2104.02101v1)
Abstract: We define a universal state sum construction which specializes to most previously known state sums (Turaev-Viro, Dijkgraaf-Witten, Crane-Yetter, Douglas-Reutter, Witten-Reshetikhin-Turaev surgery formula, Brown-Arf). The input data for the state sum is an n-category satisfying various conditions, including finiteness, semisimplicity and n-pivotality. From this n-category one constructs an n+1-dimensional TQFT, and applying the TQFT gluing rules to a handle decomposition of an n+1-manifold produces the state sum.
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.