Next-to-leading order in the large N expansion of the multi-orientable random tensor model
Abstract
In this paper we analyze in detail the next-to-leading order (NLO) of the recently obtained large N expansion for the multi-orientable (MO) tensor model. From a combinatorial point of view, we find the class of Feynman tensor graphs contributing to this order in the expansion. Each such NLO graph is characterized by the property that it contains a certain non-orientable ribbon subgraph (a non-orientable jacket). Furthermore, we find the radius of convergence and the susceptibility exponent of the NLO series for this model. These results represent a first step towards the larger goal of defining an appropriate double-scaling limit for the MO tensor model.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.