Counting Curves with Tangencies

Interpreting tangency as a limit of two transverse intersections, we obtain a concrete formula to enumerate smooth degree plane curves tangent to a given line at multiple points with arbitrary order of tangency. Extending that idea, we then enumerate curves with one node with multiple tangencies to...

Повний опис

Збережено в:
Бібліографічні деталі
Опубліковано в: :Symmetry, Integrability and Geometry: Methods and Applications
Дата:2025
Автори: Biswas, Indranil, Choudhury, Apratim, Mukherjee, Ritwik, Paul, Anantadulal
Формат: Стаття
Мова:Англійська
Опубліковано: Інститут математики НАН України 2025
Онлайн доступ:https://nasplib.isofts.kiev.ua/handle/123456789/212879
Теги: Додати тег
Немає тегів, Будьте першим, хто поставить тег для цього запису!
Назва журналу:Digital Library of Periodicals of National Academy of Sciences of Ukraine
Цитувати:Counting Curves with Tangencies. Indranil Biswas, Apratim Choudhury, Ritwik Mukherjee and Anantadulal Paul. SIGMA 21 (2025), 012, 50 pages

Репозитарії

Digital Library of Periodicals of National Academy of Sciences of Ukraine
Опис
Резюме:Interpreting tangency as a limit of two transverse intersections, we obtain a concrete formula to enumerate smooth degree plane curves tangent to a given line at multiple points with arbitrary order of tangency. Extending that idea, we then enumerate curves with one node with multiple tangencies to a given line of any order. Subsequently, we enumerate curves with one cusp that are tangent to first order to a given line at multiple points. We also present a new way to enumerate curves with one node; it is interpreted as a degeneration of a curve tangent to a given line. That method is extended to enumerate curves with two nodes, and also curves with one tacnode are enumerated. In the final part of the paper, it is shown how this idea can be applied in the setting of stable maps and perform a concrete computation to enumerate rational curves with first-order tangency. A large number of low-degree cases have been worked out explicitly.
ISSN:1815-0659