{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,10]],"date-time":"2026-03-10T14:24:49Z","timestamp":1773152689434,"version":"3.50.1"},"reference-count":0,"publisher":"The Electronic Journal of Combinatorics","issue":"4","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Electron. J. Combin."],"abstract":"<jats:p>Kontsevich's formula is a recursion that calculates the number of rational degree $d$ curves in $\\mathbb{P}_{\\mathbb{C}}^2$ passing through $3d-1$ points in general position. Kontsevich proved it by considering curves that satisfy extra conditions besides the given point conditions. These crucial extra conditions are two line conditions and a condition called cross-ratio.\r\nThis paper addresses the question whether there is a general Kontsevich's formula\u00a0which holds for more than one cross-ratio. Using tropical geometry, we obtain such a recursive formula. For that, we use a correspondence theorem of Tyomkin that relates the algebro-geometric numbers in question to tropical ones. It turns out that the general tropical Kontsevich's formula we obtain is capable of not only computing the algebro-geometric numbers we are looking for, but also of computing further tropical numbers for which there is no correspondence theorem yet.\r\nWe show that our recursive general Kontsevich's formula implies the original Kontsevich's formula and that the initial values are the numbers Kontsevich's fomula provides and purely combinatorial numbers, so-called cross-ratio multiplicities.<\/jats:p>","DOI":"10.37236\/9422","type":"journal-article","created":{"date-parts":[[2020,11,20]],"date-time":"2020-11-20T05:51:04Z","timestamp":1605851464000},"source":"Crossref","is-referenced-by-count":2,"title":["Generalizing Tropical Kontsevich's Formula to Multiple Cross-Ratios"],"prefix":"10.37236","volume":"27","author":[{"given":"Christoph","family":"Goldner","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"23455","published-online":{"date-parts":[[2020,11,13]]},"container-title":["The Electronic Journal of Combinatorics"],"original-title":[],"link":[{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v27i4p26\/8207","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v27i4p26\/8207","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,20]],"date-time":"2020-11-20T05:51:05Z","timestamp":1605851465000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/view\/v27i4p26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,11,13]]},"references-count":0,"journal-issue":{"issue":"4","published-online":{"date-parts":[[2020,10,2]]}},"URL":"https:\/\/doi.org\/10.37236\/9422","relation":{},"ISSN":["1077-8926"],"issn-type":[{"value":"1077-8926","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,11,13]]},"article-number":"P4.26"}}