pith. sign in

arxiv: 0902.4517 · v3 · pith:SMYJT4VQnew · submitted 2009-02-26 · 🌊 nlin.SI

On some class of reductions for Itoh-Narita-Bogoyavlenskii lattice

classification 🌊 nlin.SI
keywords classconstraintsdiscreteitoh-narita-bogoyavlenskiilatticeappropriatebroadcompatible
0
0 comments X
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.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. A non-commutative discrete first Painlev\'e hierarchy: the Lax pair approach

    nlin.SI 2026-05 unverdicted novelty 6.0

    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 ...