Log topological recursion through the prism of $x-y$ swap
Fuente:
arXiv
Saved in:
| Main Authors: | , , , , |
|---|---|
| Format: | Preprint |
| Published: |
2023
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866912192769556480 |
|---|---|
| author | Alexandrov, Alexander Bychkov, Boris Dunin-Barkowski, Petr Kazarian, Maxim Shadrin, Sergey |
| author_facet | Alexandrov, Alexander Bychkov, Boris Dunin-Barkowski, Petr Kazarian, Maxim Shadrin, Sergey |
| contents | We introduce a new concept of logarithmic topological recursion that provides a patch to topological recursion in the presence of logarithmic singularities and prove that this new definition satisfies the universal $x-y$ swap relation. This result provides a vast generalization and a proof of a very recent conjecture of Hock. It also uniformly explains (and conceptually rectifies) an approach to the formulas for the $n$-point functions proposed by Hock. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2312_16950 |
| institution | arXiv |
| publishDate | 2023 |
| record_format | arxiv |
| spellingShingle | Log topological recursion through the prism of $x-y$ swap Alexandrov, Alexander Bychkov, Boris Dunin-Barkowski, Petr Kazarian, Maxim Shadrin, Sergey Mathematical Physics High Energy Physics - Theory Algebraic Geometry Combinatorics We introduce a new concept of logarithmic topological recursion that provides a patch to topological recursion in the presence of logarithmic singularities and prove that this new definition satisfies the universal $x-y$ swap relation. This result provides a vast generalization and a proof of a very recent conjecture of Hock. It also uniformly explains (and conceptually rectifies) an approach to the formulas for the $n$-point functions proposed by Hock. |
| title | Log topological recursion through the prism of $x-y$ swap |
| topic | Mathematical Physics High Energy Physics - Theory Algebraic Geometry Combinatorics |
| url | https://arxiv.org/abs/2312.16950 |