Related papers: The pentagram map and Y-patterns
The pentagram map is a discrete integrable system first introduced by Schwartz in 1992. It was proved to be intregable by Schwartz, Ovsienko, and Tabachnikov in 2010. Gekhtman, Shapiro, and Vainshtein studied Poisson geometry associated to…
The landscapes of a polyhedron are subsets of its nets one must consider to identify all shortest paths. Landscapes of cubes and tetrahedra have been used to identify coordinate based formulas for the lengths of the shortest paths between…
We extend the notion of $y$-variables (coefficients) in cluster algebras to cluster scattering diagrams. Accordingly, we extend the dilogarithm identity associated with a period in a cluster pattern to the one associated with a loop in a…
We define a so-called square $k$-zig-zag shape as a part of the regular square grid. Considering the shape as a $k$-zig-zag digraph, we give values of its vertices according to the number of the shortest paths from a base vertex. It…
We provide upper and lower bounds on the least-perimeter way to enclose and separate n regions of equal area in the plane. Along the way, inside the hexagonal honeycomb, we provide minimizers for each n .
A grid polygon is a polygon whose vertices are points of a grid. We define an injective map between permutations of length n and a subset of grid polygons on n vertices, which we call consecutive-minima polygons. By the kernel method, we…
In this article we consider combinatorial maps approach to graphs on surfaces, and how between them can be establish terminological uniformity in favor of combinatorial maps in way rotations are set as base structural elements and all other…
Some idea, which leads to a non-trivial solution of the quantum four-simplex equation, is exposed in this paper. We call this idea "pentagonal algebra". Few examples of the realisation of this idea are given here, and thus few examples of…
Using the LP algebraic toolkit, Conway's original topograph is rethought of as a cluster construction, paving the way for a wider topography based on mutation-type local rules. As a remarkable application of such cluster-driven upgrade,…
This chapter is an introduction to the connection between random matrices and maps, i.e graphs drawn on surfaces. We concentrate on the one-matrix model and explain how it encodes and allows to solve a map enumeration problem.
We construct the quaternion algebra [10] "geometrically" by a three dimensional analogue of the classic two dimensional geometric description of the complex field. The algebraic description of the multiplication operation in three…
This work studies path planning in two-dimensional space, in the presence of polygonal obstacles. We specifically address the problem of building a roadmap graph, that is, an abstract representation of all the paths that can potentially be…
We provide necessary and sufficient conditions for maps that satisfy associative-like conditions on families of n-ary magmas to be pentagon maps. We obtain parametric-pentagon maps and we propose a procedure that generates families of…
We classify rational solutions of a specific type of the set theoretical version of the pentagon equation. That is, we find all quadrirational maps $R:(x,y)\mapsto (u(x,y),v(x,y)),$ where $u, v$ are two rational functions on two arguments,…
The classical notion of retraction map used to approximate geodesics is extended and rigorously defined to become a powerful tool to construct geometric integrators and it is called discretization map. Using the geometry of the tangent and…
Given a real, symmetric matrix S, we define the slice through S as being the connected component containing S of two orbits under conjugation: the first by the orthogonal group, and the second by the upper triangular group. We describe some…
A linear map between matrix spaces is positive if it maps positive semidefinite matrices to positive semidefinite ones, and is called completely positive if all its ampliations are positive. In this article quantitative bounds on the…
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.…
Birational Yang-Baxter maps (`set-theoretical solutions of the Yang-Baxter equation') are considered. A birational map $(x,y)\mapsto(u,v)$ is called quadrirational, if its graph is also a graph of a birational map $(x,v)\mapsto(u,y)$. We…
This is a first step guide to the theory of cluster algebras. We especially focus on basic notions, techniques, and results concerning seeds, cluster patterns, and cluster algebras.