Related papers: Dimer spaces and gliding systems
With every matching in a graph we associate a group called the matching group. We study this group using the theory of non-positively curved cubed complexes. Our approach is formulated in terms of so-called gliding systems.
The aim of this thesis is to present the notion of spaces whose curvature is bounded above, and to give some of its application in the context of Combinatorial Algebra. The thesis is made of two parts, one of theoretic purpose, and the…
This is a contribution to the number theory of the dimer problem. The number of dimer coverings (i.e., perfect matchings) of a square lattice graph is discussed modulo powers of 2.
The connection between quiver gauge theories and dimer models has been well studied. It is known that the matter fields of the quiver gauge theories can be represented using the perfect matchings of the corresponding dimer model.We…
We apply dimer diagram techniques to uncover discrete global symmetries in the fields theories on D3-branes at singularities given by general orbifolds of general toric Calabi-Yau threefold singularities. The discrete symmetries are…
In a seminal paper, Stallings introduced folding of morphisms of graphs. One consequence of folding is the representation of finitely-generated subgroups of a finite-rank free group as immersions of finite graphs. Stallings's methods allow…
Let G be a graph. The (unlabeled) configuration space of n points on G is the space of all n-element subsets of G. The fundamental group of such a configuration space is called a graph braid group. We use a version of discrete Morse theory…
The graph braid group of a complete bipartite graph is the fundamental group of a configuration space of points on the graph, which is a CAT(0) cube complex. We combine an analysis of the topology of links of vertices in this complex, the…
The class of quasi-median graphs is a generalisation of median graphs, or equivalently of CAT(0) cube complexes. The purpose of this thesis is to introduce these graphs in geometric group theory. In the first part of our work, we extend the…
The classical dimer model is concerned with the (weighted) enumeration of perfect matchings of a graph. An $n$-dimer cover is a multiset of edges that can be realized as the disjoint union of $n$ individual matchings. For a probability…
We study a model of fully-packed dimer configurations (or perfect matchings) on a bipartite periodic graph that is two-dimensional but not planar. The graph is obtained from $\mathbb Z^2$ via the addition of an extensive number of extra…
A simplicial complex is called negatively curved if all its simplices are isometric to simplices in hyperbolic space, and it satisfies Gromov's Link Condition. We prove that, subject to certain conditions, a compact graph of spaces whose…
We develop a generalized covering space theory for a class of uniform spaces called coverable spaces. Coverable spaces include all geodesic metric spaces, connected and locally pathwise connected compact topological spaces, in particular…
The dimer model is the study of random dimer covers (perfect matchings) of a graph. A double-dimer configuration on a graph $G$ is a union of two dimer covers of $G$. We introduce quaternion weights in the dimer model and show how they can…
The study of very large graphs is a prominent theme in modern-day mathematics. In this paper we develop a rigorous foundation for studying the space of finite labelled graphs and their limits. These limiting objects are naturally countable…
The monopole-dimer model introduced recently is an exactly-solvable signed generalisation of the dimer model. We show that the partition function of the monopole-dimer model on a graph invariant under a fixed-point free involution is a…
We prove that all finite graphs of groups with cyclic vertex and edge groups act freely and isometrically on a complete, nonpositively curved geodesic metric space.
We introduce the polygonalisation complex of a surface, a cube complex whose vertices correspond to polygonalisations. This is a geometric model for the mapping class group and it is motivated by works of Harer, Mosher and Penner. Using…
Graphings are special bounded-degree graphs on probability spaces, representing limits of graph sequences that are convergent in a local or local-global sense. We describe a procedure for turning the underlying space into a compact metric…
A dynamical system with discrete time is studied by means of algebraic geometry. The system admits a reduction that is interpreted as a classical field theory in 2+1-dimensional wholly discrete space-time. The integrals of motion of a…