The Schwarzian octahedron recurrence (dSKP equation) I: explicit solutions

From MaRDI portal
Publication:6138915

DOI10.5070/C63261993zbMATH Open1527.05012arXiv2208.00239OpenAlexW4297652755MaRDI QIDQ6138915FDOQ6138915


Authors: Béatrice de Tilière, Paul Melotti Edit this on Wikidata


Publication date: 16 December 2023

Published in: Combinatorial Theory (Search for Journal in Brave)

Abstract: We prove an explicit expression for the solutions of the discrete Schwarzian octahedron recurrence, also known as the discrete Schwarzian KP equation (dSKP), as the ratio of two partition functions. Each one counts weighted oriented dimer configurations of an associated bipartite graph, and is equal to the determinant of a Kasteleyn matrix. This is in the spirit of Speyer's result on the dKP equation, or octahedron recurrence [Spe07]. One consequence is that dSKP has zero algebraic entropy, meaning that the growth of the degrees of the polynomials involved is only polynomial. There are cancellations in the partition function, and we prove an alternative, cancellation free explicit expression involving complementary trees and forests. Using all of the above, we show several instances of the Devron property for dSKP, i.e., that certain singularities in initial data repeat after a finite number of steps. This has many applications for discrete geometric systems and is the subject of the companion paper [AdTM22]. We also prove limit shape results analogous to the arctic circle of the Aztec diamond. Finally, we discuss the combinatorics of all the other octahedral equations in the classification of Adler, Bobenko and Suris [ABS12].


Full work available at URL: https://arxiv.org/abs/2208.00239




Recommendations




Cites Work






This page was built for publication: The Schwarzian octahedron recurrence (dSKP equation) I: explicit solutions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6138915)