Degree Complexity of a Family of Birational Maps
Eric Bedford, Kyounghee Kim, Truong Trung Tuyen, Nina Abarenkova, and, Jean-Marie Maillard
TL;DR
This paper calculates the degree complexity of a specific family of birational plane maps, especially those with complex singularities, providing insights into their algebraic and geometric properties.
Contribution
It introduces a method to compute degree complexity for birational maps with high order singularities, advancing understanding of their algebraic structure.
Findings
Degree complexity computed for the family of maps.
High order singularities analyzed in the context of birational mappings.
Results contribute to the classification of birational maps based on complexity.
Abstract
We compute the degree complexity of a family of birational mappings of the plane with high order singularities.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.