Related papers: Higher pentagram maps, weighted directed networks,…
We describe a class of integrable systems on Poisson submanifolds of the affine Poisson-Lie groups $\widehat{PGL}(N)$, which can be enumerated by cyclically irreducible elements the co-extended affine Weyl groups $(\widehat{W}\times…
We prove that the class of cluster integrable systems constructed by Goncharov and Kenyon out of the dimer model on a torus coincides with the one defined by Gekhtman, Shapiro, Tabachnikov, and Vainshtein using Postnikov's perfect networks.…
In this PhD thesis we develop the frame work of triple crossing diagram maps (TCD maps), which describes constrained configurations of points in projective spaces and discrete dynamics on these configurations. We are able to capture the…
It is known that there is a one-to-one mapping between oriented directed graphs and zero-sum replicator dynamics (Lotka-Volterra equations) and that furthermore these dynamics are Hamiltonian in an appropriately defined nonlinear Poisson…
Postnikov's plabic graphs in a disk are used to parametrize totally positive Grassmannians. In recent years plabic graphs have found numerous applications in math and physics. One of the key features of the theory is the fact that if a…
We introduce a family of generalizations of the pentagram maps related to $Q$-nets. A specific example is considered, and we find the map can be treated as a refactorization mapping in the Poisson-Lie group of pseudo-difference operators.…
Building upon [1], this study aims to introduce fractal geometry into graph theory, and to establish a potential theoretical foundation for complex networks. Specifically, we employ the method of substitution to create and explore…
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…
Skew pentagram maps act on polygons by intersecting diagonals of different lengths. They were introduced by Khesin-Soloviev in 2015 as conjecturally non-integrable generalizations of the pentagram map, a well-known integrable system. In…
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…
We propose a new family of natural generalizations of the pentagram map from 2D to higher dimensions and prove their integrability on generic twisted and closed polygons. In dimension $d$ there are $d-1$ such generalizations called dented…
As an improvement of the combinatorial realization of totally positive matrices via the essential positive weightings of certain planar network by S.Fomin and A.Zelevisky \cite{[4]}, in this paper, we give the test method of positive…
This paper provides some applications of the Poisson cohomology groups introduced by Flato, Gerstenhaber and Voronov. Given an abelian extension of a Poisson algebra by a representation, we first investigate the inducibility of a pair of…
We show that the space of orthogonally separable coordinates on the sphere $S^3$ induces a natural family of integrable systems, which after symplectic reduction leads to a family of integrable systems on $S^2 \times S^2$. The generic…
Two discrete dynamical systems are discussed and analyzed whose trajectories encode significant explicit information about a number of problems in combinatorial probability, including graphical enumeration on Riemann surfaces and random…
We introduce triple crossing diagram (TCD) maps, which encode projective configurations of points and lines, as a unified framework for constructions arising in various areas of geometry, such as discrete differential geometry, discrete…
The pentagram map takes a planar polygon $P$ to a polygon $P'$ whose vertices are the intersection points of consecutive shortest diagonals of $P$. The orbit of a convex polygon under this map is a sequence of polygons which converges…
We revisit recent results on integrable cases for higher-dimensional generalizations of the 2D pentagram map: short-diagonal, dented, deep-dented, and corrugated versions, and define a universal class of pentagram maps, which are proved to…
Graph LP algebras are a generalization of cluster algebras introduced by Lam and Pylyavskyy. We provide a combinatorial proof of positivity for certain cluster variables in these algebras. This proof uses a hypergraph generalization of…
This paper characterizes hierarchical clustering methods that abide by two previously introduced axioms -- thus, denominated admissible methods -- and proposes tractable algorithms for their implementation. We leverage the fact that, for…