Related papers: Geometry of unimodular systems
In this paper we show that, for a class of countable graphs, every representation of the associated graph algebra in a separable Hilbert space is unitarily equivalent to a representation obtained via branching systems.
The motivation of this work is to define cohomology classes in the space of knots that are both easy to find and to evaluate, by reducing the problem to simple linear algebra. We achieve this goal by defining a combinatorial graded cochain…
Spatial dependency and spatial embedding are basic physical properties of many phenomena modeled by networks. The most indicated computational environment to deal with spatial information is to use Georeferenced Information System (GIS) and…
The leitmotiv of this review is noncommutative principal U(1)-bundles and associated line bundles. In the first part I give a brief introduction to Hopf-Galois theory and its applications, from field extensions to principal group actions. I…
A graph $G$ has an associated multimatroid $\mathcal{Z}_3(G)$, which is equivalent to the isotropic system of $G$ studied by Bouchet. In previous work it was shown that $G$ is a circle graph if and only if for every field $\mathbb F$, the…
We give a necessary and sufficient graph-theoretic characterization of toric ideals of graphs that are unimodular. As a direct consequence, we provide the structure of unimodular graphs by proving that the incidence matrix of a graph $G$ is…
A metrized graph is a compact singular 1-manifold endowed with a metric. A given metrized graph can be modelled by a family of weighted combinatorial graphs. If one chooses a sequence of models from this family such that the vertices become…
Hyperbolic geometry has emerged as an effective latent space for representing complex networks, owing to its ability to capture hierarchical organization and heterogeneous connectivity patterns using low-dimensional embeddings. As a result,…
In this paper we introduce the notion of an idempotent system. This linear algebraic object is motivated by the structure of an association scheme. We focus on a family of idempotent systems, said to be symmetric. A symmetric idempotent…
A geometric grid class consists of those permutations that can be drawn on a specified set of line segments of slope \pm1 arranged in a rectangular pattern governed by a matrix. Using a mixture of geometric and language theoretic methods,…
In this paper, we introduce the notion of a dual topological graph of a given topological graph, and show that it defines a C*-algebra isomorphic to the C*-algebra of the given one. Repeating to take a dual, and taking a projective limit,…
In two dimensional digital geometry, two lattice points are 4-connected (resp. 8-connected) if their Euclidean distance is at most one (resp. $\sqrt{2}$). A set $S \subset Z^2$ is 4-connected (resp. 8-connected) if for all pair of points…
Using a notation of corner between edges when graph has a fixed rotation, i.e. cyclical order of edges around vertices, we define combinatorial objects - combinatorial maps as pairs of permutations, one for vertices and one for faces.…
This article studies a large, general class of orthogonal polytopes which we may call "generic orthotopes". These objects emerged from a desire to represent a Coxeter complex by an orthogonal polytope that is particularly nice with respect…
A wealth of geometric and combinatorial properties of a given linear endomorphism $X$ of $\R^N$ is captured in the study of its associated zonotope $Z(X)$, and, by duality, its associated hyperplane arrangement ${\cal H}(X)$. This…
We present a general framework for constructing solvable lattice models of chaotic many-body quantum dynamics with multiple unitary directions using biunitary connections. We show that a network of biunitary connections on the Kagome…
After introducing some motivations for this survey, we describe a formalism to parametrize a wide class of algebraic structures occurring naturally in various problems of topology, geometry and mathematical physics. This allows us to define…
An integral polytope is a polytope whose vertices have integer coordinates. A unimodular triangulation of an integral polytope in $\mathbb{R}^d$ is a triangulation in which all simplices are integral with volume $1/d!$. A classic result of…
Urysohn constructed a separable complete universal metric space homogeneous for all finite subspaces, which is today called the Urysohn universal metric space. Some authors have recently investigated an ultrametric analogue of this space.…
In a graph G, the cardinality of the smallest ordered set of vertices that distinguishes every element of V (G) (resp. E(G)) is called the vertex (resp. edge) metric dimension of G. In [16] it was shown that both vertex and edge metric…