Searcharxiv⌕ Search

arXiv subjects

Anton Izosimov

Publications and source records attributed to Anton Izosimov.

At least 19 recordsLinked to original sources
arXiv2026

Integrability of Cauchy problems for discrete conformal maps and circle patterns

A map from a square lattice to the Riemann sphere is called discrete conformal if the image of every elementary square is a harmonic quadrilateral. We prove that the initial value problem for discrete conformal maps with quasi-periodic boundary conditions is Liouville integrable. We also show that the image of the embedding of Schramm's orthogonal square grid circle patterns into the space of discrete conformal maps is the real part of a symplectic leaf. As a consequence, we obtain the integrability of the corresponding Cauchy problem for circle patterns.

math.DS↗
arXiv2026

Virasoro extensions for diffeomorphisms with breaks

We study homeomorphisms of the circle that are smooth diffeomorphisms away from a finite set of $n$ points. These "broken diffeomorphisms" do not form a Lie group, but instead naturally assemble into a Lie groupoid. We construct an explicit nontrivial $n$-dimensional central extension of this groupoid, which restricts to the classical Virasoro group when confined to smooth diffeomorphisms. We further describe the associated "broken Virasoro" algebroid, defined as a nontrivial $n$-dimensional central extension of the Lie algebroid of vector fields on the circle that are smooth except at $n$ points. This construction generalizes the Virasoro algebra. As a byproduct, we analyze a related setting on an interval: we construct a nontrivial central extension of the Lie algebra of vector fields vanishing at the endpoints, together with the corresponding central extension of the group of diffeomorphisms fixing the endpoints. We also describe the associated Lie algebroid and groupoid obtained by allowing the endpoints to vary.

math.DG↗
arXiv2026

Surface topology and incidence theorems over division rings

Incidence theorems concern configurations of points, lines, and, more generally, higher-dimensional subspaces in projective space. Broadly speaking, such theorems fall into two classes: those that hold over an arbitrary division ring, such as Desargues' theorem, and those that hold only over fields, such as Pappus' theorem. In this paper, we explain the topological origin of this distinction. To this end, we extend to the noncommutative setting the surface-graph approach to incidence theorems developed by Richter-Gebert, Fomin, and Pylyavskyy. We then show that theorems associated with graphs embedded on the sphere, such as Desargues' theorem, hold over any division ring, whereas theorems corresponding to graphs embedded on surfaces of positive genus, such as Pappus' theorem, typically hold if and only if the ground ring is a field. We also extend these results to the setting of arbitrary rings, not necessarily admitting division.

math.CO↗
arXiv2025

The dimer model and dynamical incidence geometry

We propose a geometric counterpart of the dimer model on bipartite graphs. A state of our model consists of a choice of a point for each white vertex and hyperplane for each black vertex. This data is subject to certain conditions determined by the graph; the resulting configurations are called coherent double circuit configurations. We show that our model behaves consistently under standard local moves of the dimer model. On the geometric side, this gives rise to a new class of theorems in linear incidence geometry - dynamical incidence theorems. Examples include results on pentagram maps, pentagram spirals, and Q-nets. We also examine the problem of parametrizing coherent double circuit configurations. In particular, we study whether, once the white-vertex part of the data is fixed, one can recover the black-vertex data from a point on the spectral curve.

math.CO↗
arXiv2025

Pentagram maps over rings, Grassmannians, and skewers

The pentagram map is a discrete dynamical system on planar polygons. By definition, the image of a polygon $P$ under the pentagram map is the polygon $P'$ whose vertices are the intersection points of consecutive shortest diagonals of $P$. The pentagram map was introduced by R. Schwartz in 1992, and is now one of the most renowned discrete integrable systems. Several authors proposed generalizations of the pentagram map to other geometries, in particular to Grassmannians, where the role of points and lines is played by higher-dimensional subspaces, as well to skewer geometry, where both points and lines are affine lines in the three-dimensional Euclidean space. In the present paper, we develop a common framework for these kinds of generalizations. Specifically, we show that those maps can be viewed as pentagram maps in the projective plane over an appropriate ring. In general, those rings need not be division rings or commutative. We show that the Grassmannian pentagram map corresponds to the ring of matrices, while the skewer map is the pentagram map over the ring of dual numbers. Furthermore, we prove that the pentagram map remains integrable for any stably finite ground ring $R$.

nlin.SI↗
arXiv2025

Planar networks and simple Lie groups beyond type A

The general linear group $GL_{n}$, along with its adjoint simple group $PGL_n$, can be described by means of weighted planar networks. In this paper we give a network description for simple Lie groups of types $B$ and $C$. The corresponding networks are axially symmetric modulo a sequence of cluster mutations along the axis of symmetry. We extend to this setting the result of Gekhtman, Shapiro, and Vainshtein on the Poisson property of Postnikov's boundary measurement map. We also show that $B$ and $C$ type networks with positive weights parametrize the totally nonnegative part of the respective group. Finally, we construct network parametrizations of double Bruhat cells in symplectic and odd-dimensional orthogonal groups, and identify the corresponding face weights with Fock-Goncharov cluster coordinates.

math.RT↗
arXiv2024

Coadjoint orbits of area-preserving diffeomorphisms of non-orientable surfaces

We give a classification of generic coadjoint orbits for the group of area-preserving diffeomorphisms of a closed non-orientable surface. This completes V. Arnold's program of studying invariants of incompressible fluids in 2D. As an auxiliary problem, we also classify simple Morse pseudo-functions on non-orientable surfaces up to area-preserving diffeomorphisms.

math.SG↗
arXiv2024

Integrable systems and cluster algebras

We review several constructions of integrable systems with an underlying cluster algebra structure, in particular the Gekhtman-Shapiro-Tabachnikov-Vainshtein construction based on perfect networks and the Goncharov-Kenyon approach based on the dimer model. We also discuss results of Galashin and Pylyavskyy on integrability of T-systems.

nlin.SI↗
arXiv2023

Geometry of generalized fluid flows

The Euler equation of an ideal (i.e. inviscid incompressible) fluid can be regarded, following V.Arnold, as the geodesic flow of the right-invariant $L^2$-metric on the group of volume-preserving diffeomorphisms of the flow domain. In this paper we describe the common origin and symmetry of generalized flows, multiphase fluids (homogenized vortex sheets), and conventional vortex sheets: they all correspond to geodesics on certain groupoids of multiphase diffeomorphisms. Furthermore, we prove that all these problems are Hamiltonian with respect to a Poisson structure on a dual Lie algebroid, generalizing the Hamiltonian property of the Euler equation on a Lie algebra dual.

math.DG↗
arXiv2022

Polygon recutting as a cluster integrable system

Recutting is an operation on planar polygons defined by cutting a polygon along a diagonal to remove a triangle, and then reattaching the triangle along the same diagonal but with opposite orientation. Recuttings along different diagonals generate an action of the affine symmetric group on the space of polygons. We show that this action is given by cluster transformations and is completely integrable. The integrability proof is based on interpretation of recutting as refactorization of quaternionic polynomials.

nlin.SI↗
arXiv2022

Long-diagonal pentagram maps

The pentagram map on polygons in the projective plane was introduced by R. Schwartz in 1992 and is by now one of the most popular and classical discrete integrable systems. In the present paper we introduce and prove integrability of long-diagonal pentagram maps on polygons in $\mathbb{R}\mathrm{P}^d$, encompassing all known integrable cases. We also establish an equivalence of long-diagonal and bi-diagonal maps and present a simple self-contained construction of the Lax form for both. Finally, we prove the continuous limit of all these maps is equivalent to the $ (2,d+1)$-KdV equation, generalizing the Boussinesq equation for $d=2$.

nlin.SI↗
arXiv2022

Change of polytope volumes under Möbius transformations and the circumcenter of mass

The circumcenter of mass of a simplicial polytope $P$ is defined as follows: triangulate $P$, assign to each simplex its circumcenter taken with weight equal to the volume of the simplex, and then find the center of mass of the resulting system of point masses. The so obtained point is independent of the triangulation. The aim of the present note is to give a definition of the circumcenter of mass that does not rely on a triangulation. To do so we investigate how volumes of polytopes change under Möbius transformations.

math.MG↗
arXiv2022

What is a lattice W-algebra?

We employ the Poisson-Lie group of pseudo-difference operators to define lattice analogs of classical $W_m$-algebras. We then show that the so-constructed algebras coincide with the ones given by discrete Drinfeld-Sokolov type reduction.

math.QA↗
arXiv2022

Pentagram maps and refactorization in Poisson-Lie groups

The pentagram map was introduced by R. Schwartz in 1992 and is now one of the most renowned discrete integrable systems. In the present paper we prove that this map, as well as all its known integrable multidimensional generalizations, can be seen as refactorization-type mappings in the Poisson-Lie group of pseudo-difference operators. This brings the pentagram map into the rich framework of Poisson-Lie groups, both describing new structures and simplifying and revealing the origin of its known properties. In particular, for multidimensional pentagram maps the Poisson-Lie group setting provides new Lax forms with a spectral parameter and, more importantly, invariant Poisson structures in all dimensions, the existence of which has been an open problem since the introduction of those maps. Furthermore, for the classical pentagram map our approach naturally yields its combinatorial description in terms of weighted directed networks and cluster algebras.

nlin.SI↗
arXiv2022

The pentagram map, Poncelet polygons, and commuting difference operators

The pentagram map takes a planar polygon $P$ to a polygon $P'$ whose vertices are the intersection points of consecutive shortest diagonals of $P$. This map is known to interact nicely with Poncelet polygons, i.e. polygons which are simultaneously inscribed in a conic and circumscribed about a conic. A theorem of R. Schwartz says that if $P$ is a Poncelet polygon, then the image of $P$ under the pentagram map is projectively equivalent to $P$. In the present paper we show that in the convex case this property characterizes Poncelet polygons: if a convex polygon is projectively equivalent to its pentagram image, then it is Poncelet. The proof is based on the theory of commuting difference operators, as well as on properties of real elliptic curves and theta functions.

nlin.SI↗
arXiv2021

Dimers, networks, and cluster integrable systems

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. To that end we express the characteristic polynomial of a perfect network's boundary measurement matrix in terms of the dimer partition function of the associated bipartite graph. Our main tool is flat geometry. Namely, we show that if a perfect network is drawn on a flat torus in such a way that the edges of the network are Euclidian geodesics, then the angles between the edges endow the associated bipartite graph with a canonical fractional Kasteleyn orientation. That orientation is then used to relate the partition function to boundary measurements.

math.CO↗
arXiv2021

Intersecting the sides of a polygon

Consider the map $S$ which sends a planar polygon $P$ to a new polygon $S(P)$ whose vertices are the intersection points of second nearest sides of $P$. This map is the inverse of the famous pentagram map. In this paper we investigate the dynamics of the map $S$. Namely, we address the question of whether a convex polygon stays convex under iterations of $S$. Computer experiments suggest that this almost never happens. We prove that indeed the set of polygons which remain convex under iterations of $S$ has measure zero, and moreover it is an algebraic subvariety of codimension two. We also discuss the equations cutting out this subvariety, as well as their geometric meaning in the case of pentagons.

math.MG↗