Tau-Structure for the Double Ramification Hierarchies - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Communications in Mathematical Physics Année : 2018

Tau-Structure for the Double Ramification Hierarchies

Résumé

In this paper we continue the study of the double ramification hierarchy of Buryak (Commun Math Phys 336(3):1085–1107, 2015). After showing that the DR hierarchy satisfies tau-symmetry we define its partition function as the (logarithm of the) tau-function of the string solution and show that it satisfies various properties (string, dilaton, and divisor equations plus some important degree constraints). We then formulate a stronger version of the conjecture from Buryak (2015): for any semisimple cohomological field theory, the Dubrovin–Zhang and double ramification hierarchies are related by a normal [i.e. preserving the tau-structure (Dubrovin et al. in Adv Math 293:382–435, 2016)] Miura transformation which we completely identify in terms of the partition function of the CohFT. In fact, using only the partition functions, the conjecture can be formulated even in the non-semisimple case (where the Dubrovin–Zhang hierarchy is not defined). We then prove this conjecture for various CohFTs (trivial CohFT, Hodge class, Gromov–Witten theory of CP1 , 3-, 4- and 5-spin classes) and in genus 1 for any semisimple CohFT. Finally we prove that the higher genus part of the DR hierarchy is basically trivial for the Gromov–Witten theory of smooth varieties with non-positive first Chern class and their analogue in Fan–Jarvis–Ruan–Witten quantum singularity theory (Fan et al. in Ann Math 178(1):1–106, 2013).

Dates et versions

hal-01899925 , version 1 (20-10-2018)

Identifiants

Citer

Alexandr Buryak, Boris Dubrovin, Jérémy Guéré, Paolo Rossi. Tau-Structure for the Double Ramification Hierarchies. Communications in Mathematical Physics, 2018, 363 (1), pp.191-260. ⟨10.1007/s00220-018-3235-4⟩. ⟨hal-01899925⟩
50 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More