Skip to content
DraconiticResearch
Search Sources API
197,768 studies31 sourcesUpdated 28 min ago
PreprintarXiv licencearXiv

Matrix Dressing Beyond Pfaff-Toda

Abstract

We develop a matrix pseudodifference operator framework that places theAdler-Pfaff and Pfaff-Toda hierarchies in a common algebraic setting. The bi-infinite Adler-Pfaff hierarchy then becomes a 2×2 matrix pseudodifference Lax hierarchy. We introduce the Matrix Pfaff-Toda hierarchy by dressing the matrix Laurent algebra M2N(ℂ[𝒮,𝒮−1]) using a Pfaff-Toda splitting of the matrix pseudodifference algebra. In the one-component case, its diagonal sector recovers the continuous Pfaff-Toda hierarchy, while the off-diagonal directions supply the missing odd flows, and the powers of a single bare operator reconstruct the full Adler-Pfaff hierarchy. For general N, on the regular factorization locus, the multicomponent Pfaff-Toda tau-functions of Savchenko and Zabrodin realize the commuting diagonal sector, with its dressing equations derived directly from the fermionic bilinear identity. Reductions to the block-diagonal and scalar cases recover multicomponent and scalar 2D Toda, identifying the even Pfaff hierarchy with an anti-diagonal Toda subhierarchy, and yielding the Krichever-Zabrodin C-Toda hierarchy.

Related

  1. The rank of the random k-XORSAT matrix beyond satisfiability
    Amin Coja-Oghlan, Maurice Rolvien
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsProbabilityarXiv
  2. Markovian Random Words, a Gaussian Random Matrix Model and Beyond
    Christian Houdré, Dorian Kidonakis
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsProbabilityarXiv
  3. Low-rank matrix recovery landscapes beyond RIP with application to rank-one measurements
    Andrew D Mcrae
    HALPreprintPublisher termsFull textOptimisation & controlStatisticsHALarXiv
  4. The Smith-Toda complex V(4) exists for p >= 11
    Vigleik Angeltveit
    arXivPreprintarXiv licenceFull textGeometry & topologyarXiv
  5. Toda chain solves large BKP
    Anton Zabrodin
    arXivPreprintarXiv licenceFull textMathematical physicsStatistical & nonlinear physicsarXiv
BibTeX
@misc{carpentier2026matrix,
  title = {{Matrix Dressing Beyond Pfaff-Toda}},
  author = {Sylvain Carpentier and Marta Dell'Atti},
  howpublished = {arXiv},
  year = {2026},
  month = sep,
  doi = {10.48550/arxiv.2609.12970},
  eprint = {2609.12970},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2609.12970},
}
RIS
TY  - UNPB
TI  - Matrix Dressing Beyond Pfaff-Toda
AU  - Sylvain Carpentier
AU  - Marta Dell'Atti
PY  - 2026
DA  - 2026/09/11
PB  - arXiv
DO  - 10.48550/arxiv.2609.12970
UR  - https://arxiv.org/abs/2609.12970
AB  - We develop a matrix pseudodifference operator framework that places theAdler-Pfaff and Pfaff-Toda hierarchies in a common algebraic setting. The bi-infinite Adler-Pfaff hierarchy then becomes a 2×2 matrix pseudodifference Lax hierarchy. We introduce the Matrix Pfaff-Toda hierarchy by dressing the matrix Laurent algebra M_2N(ℂ[𝒮,𝒮^−1]) using a Pfaff-Toda splitting of the matrix pseudodifference algebra. In the one-component case, its diagonal sector recovers the continuous Pfaff-Toda hierarchy, while the off-diagonal directions supply the missing odd flows, and the powers of a single bare operator reconstruct the full Adler-Pfaff hierarchy. For general N, on the regular factorization locus, the multicomponent Pfaff-Toda tau-functions of Savchenko and Zabrodin realize the commuting diagonal sector, with its dressing equations derived directly from the fermionic bilinear identity. Reductions to the block-diagonal and scalar cases recover multicomponent and scalar 2D Toda, identifying the even Pfaff hierarchy with an anti-diagonal Toda subhierarchy, and yielding the Krichever-Zabrodin C-Toda hierarchy.
ER  -