Combinatorics of KP hierarchy structural constants
We investigate the structural constants of the KP hierarchy, which appear as universal coefficients in the paper of Natanzon–Zabrodin arXiv:1509.04472 . It turns out that these constants have a combinatorial description in terms of transport coefficients in the theory of flow networks. Considering i...
Gespeichert in:
Veröffentlicht in: | The European physical journal. C, Particles and fields Particles and fields, 2021-12, Vol.81 (12), p.1-15, Article 1136 |
---|---|
Hauptverfasser: | , , , |
Format: | Artikel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
Zusammenfassung: | We investigate the structural constants of the KP hierarchy, which appear as universal coefficients in the paper of Natanzon–Zabrodin
arXiv:1509.04472
. It turns out that these constants have a combinatorial description in terms of transport coefficients in the theory of flow networks. Considering its properties we want to point out three novel directions of KP combinatorial structure research: connection with topological recursion, eigenvalue model for the structural constants and its deformations, possible deformations of KP hierarchy in terms of the structural constants. Firstly, in this paper we study the internal structure of these coefficients which involves: (1) construction of generating functions that have interesting properties by themselves; (2) restrictions on topological recursion initial data; (3) construction of integral representation or matrix model for these coefficients with non-trivial Ward identities. This shows that these coefficients appear in various problems of mathematical physics, which increases their value and significance. Secondly, we discuss their role in integrability of KP hierarchy considering possible deformation of these coefficients without changing the equations on
τ
-function. We consider several plausible deformations. While most failed even very basic checks, one deformation (involving Macdonald polynomials) passes all the simple checks and requires more thorough study. |
---|---|
ISSN: | 1434-6044 1434-6052 |
DOI: | 10.1140/epjc/s10052-021-09899-8 |