Classification of higher grade graphs for U(N)2× O(D) multi-matrix models

Abstract

The authors studied in [Ann. Inst. Henri Poincar\'e D 9, 367-433, (2022)], a complex multi-matrix model with U(N)2 × O(D) symmetry, and whose double scaling limit where simultaneously the large-N and large-D limits were taken while keeping the ratio N/D=M finite and fixed. In this double scaling limit, the complete recursive characterization of the Feynman graphs of arbitrary genus for the leading order grade =0 was achieved. In this current study, we classify the higher order graphs in . More specifically, =1 and =2 with arbitrary genus, in addition to a specific class of two-particle-irreducible (2PI) graphs for higher ≥slant 3 but with genus zero. Furthermore, we demonstrate that each 2PI graph with a single O(D)-loop with an arbitrary corresponds to a reduced alternating knot diagram with crossings as listed in the Rolfsen knot table, or a resulting alternating knot diagram obtained after performing the Tait flyping moves. We generalize to 2PR by considering the connected sum and the Reidemeister move I.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…