Degree complexity of a family of birational maps: II. Exceptional cases
Tuyen Trung Truong
TL;DR
This paper calculates the degree complexity of a specific family of birational maps in exceptional cases and explores some of their interesting properties.
Contribution
It provides the first comprehensive computation of degree complexity for these maps in all exceptional cases, extending previous work.
Findings
Degree complexity values for all exceptional cases
Identification of unique properties in the family
Extension of prior results to exceptional scenarios
Abstract
We compute the degree complexity of the family of birational maps considered in \cite{bedford-kim-tuyen-abarenkova-maillard} for all exceptional cases. Some interesting properties of the family are also given.
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.
Taxonomy
TopicsRings, Modules, and Algebras · semigroups and automata theory · Algebraic Geometry and Number Theory