{"paper":{"title":"A non-commutative discrete first Painlev\\'e hierarchy: the Lax pair approach","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math-ph","math.MP","math.RA"],"primary_cat":"nlin.SI","authors_text":"Irina Bobrova","submitted_at":"2026-05-28T10:17:54Z","abstract_excerpt":"Using a non-commutative analogue of the isomonodromic problem associated with the discrete first Painlev\\'e hierarchy, we construct a non-commutative version of this hierarchy, denoted by $\\text{d-PI}_m^{\\text{nc}}$. We show that both hierarchies, $\\text{d-PI}_m$ and $\\text{d-PI}_m^{\\text{nc}}$, can be expressed in terms of the polynomials $S_s^k(n)$, which we call the Svinin polynomials. We also derive a reduction of the non-commutative Volterra lattice hierarchy to the $\\text{d-PI}_m^{\\text{nc}}$ hierarchy and present explicit continuous limits for the first three members of the $\\text{d-PI}"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.29722","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2605.29722/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"}