Papers › Kapranov degrees
Kapranov degrees
Joshua Brakensiek, Christopher Eur, Matt Larson, Shiyue Li
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
The moduli space of stable rational curves with marked points has two distinguished families of maps: the forgetful maps, given by forgetting some of the markings, and the Kapranov maps, given by complete linear series of ψ-classes. The collection of all these maps embeds the moduli space into a product of projective spaces. We call the multidegrees of this embedding ``Kapranov degrees,'' which include as special cases the work of Witten, Silversmith, Gallet--Grasegger--Schicho, Castravet--Tevelev, Postnikov, Cavalieri--Gillespie--Monin, and Gillespie--Griffins--Levinson. We establish, in terms of a combinatorial matching condition, upper bounds for Kapranov degrees and a characterization of their positivity. The positivity characterization answers a question of Silversmith and gives a new proof of Laman's theorem characterizing generically rigid graphs in the plane. We achieve this by proving a recursive formula for Kapranov degrees and by using tools from the theory of error correcting codes.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections