Papers
Topics
Authors
Recent
Search
2000 character limit reached

Universal construction in monoidal and non-monoidal settings, the Brauer envelope, and pseudocharacters

Published 5 Mar 2023 in math.QA, math-ph, math.CT, math.MP, and math.RT | (2303.02696v1)

Abstract: This paper clarifies basic definitions in the universal construction of topological theories and monoidal categories. The definition of the universal construction is given for various types of monoidal categories, including rigid and symmetric. It is also explained how to set up the universal construction for non-monoidal categories. The second part of the paper explains how to associate a rigid symmetric monoidal category to a small category, a sort of the Brauer envelope of a category. The universal construction for the Brauer envelopes generalizes some earlier work of the first two authors on automata, power series and topological theories. Finally, the theory of pseudocharacters (or pseudo-representations), which is an essential tool in modern number theory, is interpreted via one-dimensional topological theories and TQFTs with defects. The notion of a pseudocharacter is studied for Brauer categories and the lifting property to characters of semisimple representations is established in characteristic 0 for Brauer categories with at most countably many objects. The paper contains a brief discussion of pseudo-holonomies, which are functions from loops in a manifold to real numbers similar to traces of the holonomies along loops of a connection on a vector bundle on the manifold. It concludes with a classification of pseudocharacters (pseudo-TQFTs) and their generating functions for the category of oriented two-dimensional cobordisms in the characteristic 0 case.

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.