Related papers: The pentagram map and Y-patterns
A map is an abstract visual representation of a region, taken from a given space, usually designed for final human consumption. Traditional cartography focuses on the mapping of Euclidean spaces by using some distance metric. In this paper…
We consider nonlinear recurrences generated from the iteration of maps that arise from cluster algebras. More precisely, starting from a skew-symmetric integer matrix, or its corresponding quiver, one can define a set of mutation…
We consider a modified notion of planarity, in which two nations of a map are considered adjacent when they share any point of their boundaries (not necessarily an edge, as planarity requires). Such adjacencies define a map graph. We give…
We take a categorical approach to describe ternary derivations and ternary automorphisms of triangular algebras. New classes of automorphisms and derivations of triangular algebras are also introduced and studied.
Matrices are the most common representations of graphs. They are also used for the representation of algebras and cluster algebras. This paper shows some properties of matrices in order to facilitate the understanding and locating…
This is a self-contained exposition of several fundamental properties of cluster scattering diagrams introduced and studied by Gross, Hacking, Keel, and Kontsevich. In particular, detailed proofs are presented for the construction, the…
A direct relation between the enumeration of ordinary maps and that of fully simple maps first appeared in the work of the first and last authors. The relation is via monotone Hurwitz numbers and was originally proved using Weingarten…
Inspired by Coxeter's notion of Petrie polygon for $d$-polytopes (see \cite{Cox73}), we consider a generalization of the notion of zigzag circuits on complexes and compute the zigzag structure for several interesting families of…
We define a simple orthogonal polyhedron to be a three-dimensional polyhedron with the topology of a sphere in which three mutually-perpendicular edges meet at each vertex. By analogy to Steinitz's theorem characterizing the graphs of…
The notion of quadratic maps between arbitrary groups appeared at several places in the literature on quadratic algebra. Here a unified extensive treatment of their properties is given; the relation with a relative version of Passi's…
Directed mixed graphs permit directed and bidirected edges between any two vertices. They were first considered in the path analysis developed by Sewall Wright and play an essential role in statistical modeling. We introduce a matrix…
Rectangulations are decompositions of a square into finitely many axis-aligned rectangles. We describe realizations of $(n-1)$-dimensional polytopes associated with two combinatorial families of rectangulations composed of $n$ rectangles.…
We define a normal graph algebra modeled on algebras used in genetics. Although the algebra does not always determine its graph, it often highlights special features. After developing basic properties of the algebra, we examine those of…
Klyachko and coworkers consider an orthogonality graph in the form of a pentagram, and in this way derive a Kochen-Specker inequality for spin 1 systems. In some low-dimensional situations Hilbert spaces are naturally organised, by a…
The set-theoretical reflection equation and its solutions, the reflection maps, recently introduced by two of the authors, is presented in general and then applied in the context of quadrirational Yang-Baxter maps. We provide a method for…
We present a new formula for the coaction of a large class of integrals. When applied to one-loop (cut) Feynman integrals, it can be given a diagrammatic representation purely in terms of pinches and cuts of the edges of the graph. The…
We introduce a new method of expressing a $k$-graph $C^*$-algebra as a Cuntz-Pimsner algebra. Kumjian, Pask, and Sims have done this directly, using a linking algebra approach and a $(k-1)$-graph algebra. This can be iterated downward. Our…
The image of a polynomial map is a constructible set. While computing its closure is standard in computer algebra systems, a procedure for computing the constructible set itself is not. We provide a new algorithm, based on algebro-geometric…
The method of Symmetries of Feynman Integrals defines for any Feynman diagram a set of partial differential equations. On some locus in parameter space the equations imply that the diagram can be reduced to a linear combination of simpler…
Hierarchical graph clustering is a common technique to reveal the multi-scale structure of complex networks. We propose a novel metric for assessing the quality of a hierarchical clustering. This metric reflects the ability to reconstruct…