Perfect t-Embeddings of Uniformly Weighted Generalized Tower Graphs

Abstract

In this paper, we study sequences of perfect t-embeddings of a uniformly weighted family of graphs we call generalized tower graphs. We show that the embeddings of these graphs satisfy certain technical assumptions, in particular, the rigidity assumption of Berggren-Nicoletti-Russkikh. As a result, we confirm the convergence of the gradients of the height function fluctuations of these graphs to those of the Gaussian free field.

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…