Inverse Algorithm and Triple Point Diagrams

Valdo Tatitscheff ()
Additional contact information
Valdo Tatitscheff: Technical University of Munich, TUM School of Computation, Information and Technology

A chapter in Nankai Symposium on Mathematical Dialogues, 2026, pp 345-352 from Springer

Abstract: Abstract Dimer models (also known as brane tilings) are special bipartite graphs on a torus $$\mathbb {T}^2$$ T 2 . They encode the structure of the 4d $$\mathcal {N}=1$$ N = 1 worldvolume theories of D3 branes probing toric affine Calabi-Yau singularities. Constructing dimer models from a singularity can in principle be done via the so-called inverse algorithm, however it is hard to implement in practice. We discuss how combinatorial objects called triple point diagrams systematize the inverse algorithm, and show how they can be used to construct dimer models satisfying some symmetry or containing particular substructures. We present the construction of the Octagon dimer model which satisfies both types of constraints. Eventually we present a new criterion concerning possible implementations of symmetries in dimer models, in order to illustrate how the use of triple point diagrams could strengthen such statements.

Date: 2026
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-981-19-2328-9_41

Ordering information: This item can be ordered from
http://www.springer.com/9789811923289

DOI: 10.1007/978-981-19-2328-9_41

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().