Constructs non-commutative discrete first Painlevé hierarchy d-PI_m^nc via non-commutative isomonodromic problem, expresses both commutative and non-commutative versions via Svinin polynomials, derives reduction from non-commutative Volterra lattice, and gives continuous limits for first three membe
On some class of reductions for Itoh-Narita-Bogoyavlenskii lattice
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
abstract
We show a broad class of constraints compatible with Itoh-Narita-Bogoyavlenskii lattice hierarchy. All these constraints can be written in the form of discrete conservation law $I_{i+1}=I_i$ with appropriate homogeneous polynomial discrete function $I=I[a]$.
fields
nlin.SI 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
A non-commutative discrete first Painlev\'e hierarchy: the Lax pair approach
Constructs non-commutative discrete first Painlevé hierarchy d-PI_m^nc via non-commutative isomonodromic problem, expresses both commutative and non-commutative versions via Svinin polynomials, derives reduction from non-commutative Volterra lattice, and gives continuous limits for first three membe