2022
DOI: 10.24033/asens.2507
|View full text |Cite
|
Sign up to set email alerts
|

Dimers and circle patterns

Abstract: We establish a correspondence between the dimer model on a bipartite graph and a circle pattern with the combinatorics of that graph, which holds for graphs that are either planar or embedded on the torus. The set of positive face weights on the graph gives a set of global coordinates on the space of circle patterns with embedded dual. Under this correspondence, which extends the previously known isoradial case, the urban renewal (local move for dimer models) is equivalent to the Miquel move (local move for ci… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
5

Citation Types

1
26
0

Year Published

2023
2023
2024
2024

Publication Types

Select...
4

Relationship

0
4

Authors

Journals

citations
Cited by 4 publications
(27 citation statements)
references
References 24 publications
(52 reference statements)
1
26
0
Order By: Relevance
“…A more geometric viewpoint on “nice” gauge functions, the so‐called Coulomb gauges , was suggested in [33]. These gauges have many remarkable algebraic properties (see also [1]) and are also closely related to T‐graphs mentioned above.…”
Section: Introductionmentioning
confidence: 99%
See 4 more Smart Citations
“…A more geometric viewpoint on “nice” gauge functions, the so‐called Coulomb gauges , was suggested in [33]. These gauges have many remarkable algebraic properties (see also [1]) and are also closely related to T‐graphs mentioned above.…”
Section: Introductionmentioning
confidence: 99%
“…In parallel, a notion of s‐embeddings of graphs carrying the planar Ising model was suggested in [9]. As explained in [33, section 7], the latter are a particular case of the former under the combinatorial bosonization correspondence of the two models [19]. The notion of t‐embeddings discussed in our paper is fully equivalent to Coulomb gauges of [33] except that we focus on embeddings of the dual graphs (scriptGδ)$(\mathcal {G}^\delta )^*$ from the very beginning.…”
Section: Introductionmentioning
confidence: 99%
See 3 more Smart Citations