On some class of reductions for Itoh-Narita-Bogoyavlenskii lattice
classification
🌊 nlin.SI
keywords
classconstraintsdiscreteitoh-narita-bogoyavlenskiilatticeappropriatebroadcompatible
read the original 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]$.
This paper has not been read by Pith yet.
Forward citations
Cited by 1 Pith paper
-
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 ...
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.