2000 character limit reached
Perfect t-Embeddings of Uniformly Weighted Generalized Tower Graphs
Published 23 Sep 2025 in math-ph, math.CO, math.MP, and math.PR | (2509.18791v1)
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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.