Diagrammatic proof of the large $N$ melonic dominance in the SYK model

Published 30 Aug 2018 in math-ph, hep-th, math.CO, and math.MP | (1808.10314v1)

Abstract: A crucial result on the celebrated Sachdev-Ye-Kitaev model is that its large $N$ limit is dominated by melonic graphs. In this letter we offer a rigorous, diagrammatic proof of that result by direct, combinatorial analysis of its Feynman graphs.

Abstract PDF Upgrade to Chat

Authors (3)

Summary

No one has generated a summary of this paper yet.

Sign Up to Summarize

Paper to Video (Beta)

No one has generated a video about this paper yet.

Sign Up to Generate All Videos Subscribe on YouTube

Whiteboard

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

Sign Up to Generate

Paper Prompts

Sign up for free to create and run prompts on this paper using GPT-5.

Top Community Prompts

Explain it Like I'm 14

Practical Applications

Conceptual Simplification

Sign Up to Activate View All Prompts

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.

Collections

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