{"@context":["https://w3id.org/fdo/context/v1",{"schema":"https://schema.org/","prov":"http://www.w3.org/ns/prov#","fdo":"https://w3id.org/fdo/vocabulary/"}],"@id":"https://fdo.portal.mardi4nfdi.de/fdo/Q936619","@type":"DigitalObject","kernel":{"@id":"https://fdo.portal.mardi4nfdi.de/fdo/Q936619","digitalObjectType":"https://schema.org/ScholarlyArticle","primaryIdentifier":"mardi:Q936619","kernelVersion":"v1","immutable":true,"modified":"2026-03-27T14:52:18Z"},"profile":{"@context":"https://schema.org","@type":"ScholarlyArticle","@id":"https://portal.mardi4nfdi.de/entity/Q936619","name":"Enumeration of rational plane curves tangent to a smooth cubic","headline":"Enumeration of rational plane curves tangent to a smooth cubic","description":"scientific article; zbMATH DE number 5313912","url":"https://portal.mardi4nfdi.de/entity/Q936619","datePublished":"2008-08-19","author":[{"@id":"https://portal.mardi4nfdi.de/entity/Q655352"},{"@id":"https://portal.mardi4nfdi.de/entity/Q217372"}],"publisher":[{"@id":"https://portal.mardi4nfdi.de/entity/Q165833"}],"identifier":{"@type":"PropertyValue","propertyID":"doi","value":"10.1016/J.AIM.2008.04.013","url":"https://doi.org/10.1016/J.AIM.2008.04.013"},"sameAs":["https://doi.org/10.1016/J.AIM.2008.04.013"],"comment":"Let \\(D\\) be a complex plane projective (reduced) curve. Given two tuples of integers \\(\\alpha=(\\alpha_1,\\alpha_2,\\dots)\\), \\(\\beta=(\\beta_1,\\beta_2,\\dots)\\) an old question of enumerative geometry is:  How many plane rational curves of degree \\(d\\) meet \\(D\\) at \\(\\alpha_k\\) fixed points with contact order \\(k\\) and \\(\\beta_k\\) non-fixed points with contact order \\(k\\)?  (All contacts with \\(D\\) are assumed at the unibranch points of \\(D\\). To make the number of rational curves finite one imposes the condition: the curves pass through \\(3d-1-\\sum k\\alpha_k-\\sum(k-1)\\beta_k\\) general points).  The problem is very difficult and only some particular cases are known. The case \\(\\alpha=0\\), \\(\\beta=(3d,0,\\dots)\\) was solved by Kontsevich, the case \\(D=\\) line by Caporaso-Harris, some cases with \\(D=\\) conic were treated by Vakil and Gathmann.  The authors treat the case \\(D=\\) cubic and \\(\\alpha,\\beta\\) arbitrary, except for \\((\\alpha,\\beta)=(0,e_{3d})\\).  The method uses several ingredients. A WDVV equation is used to provide relations among the invariants. This brings some non-enumerative contributions. The authors relate these contributions to some enumerative invariants. Further, the Caporaso-Harris recursion is used.  An interesting result is that the computation of all such numbers \\(N_d(\\alpha,\\beta)\\) is reduced to a smaller set of numbers \\(M_d(\\alpha+\\beta)\\) by  \\[ N_d(\\alpha,\\beta)=\\prod k^{\\beta_k}(\\sum k\\beta_k)\\frac{(\\sum\\beta_k-1)!}{\\prod(\\beta_k!)}M_d(\\alpha+\\beta) \\]  and the later numbers \\(M_d(\\alpha+\\beta)\\) can be defined independently of the initial ones.","citation":[{"@id":"https://portal.mardi4nfdi.de/entity/Q5302218"},{"@id":"https://portal.mardi4nfdi.de/entity/Q4418321"},{"@id":"https://portal.mardi4nfdi.de/entity/Q3535013"},{"@id":"https://portal.mardi4nfdi.de/entity/Q4409406"},{"@id":"https://portal.mardi4nfdi.de/entity/Q2758957"},{"@id":"https://portal.mardi4nfdi.de/entity/Q1359213"},{"@id":"https://portal.mardi4nfdi.de/entity/Q3437325"},{"@id":"https://portal.mardi4nfdi.de/entity/Q3437224"},{"@id":"https://portal.mardi4nfdi.de/entity/Q1385034"},{"@id":"https://portal.mardi4nfdi.de/entity/Q4409407"},{"@id":"https://portal.mardi4nfdi.de/entity/Q4342000"},{"@id":"https://portal.mardi4nfdi.de/entity/Q1566331"},{"@id":"https://portal.mardi4nfdi.de/entity/Q4681966"},{"@id":"https://portal.mardi4nfdi.de/entity/Q4398861"},{"@id":"https://portal.mardi4nfdi.de/entity/Q2558417"},{"@id":"https://portal.mardi4nfdi.de/entity/Q2503376"},{"@id":"https://portal.mardi4nfdi.de/entity/Q5953626"},{"@id":"https://portal.mardi4nfdi.de/entity/Q1575057"},{"@id":"https://portal.mardi4nfdi.de/entity/Q908977"}]},"provenance":{"prov:generatedAtTime":"2026-03-27T14:52:18Z","prov:wasAttributedTo":"MaRDI Knowledge Graph"}}