The Degree Complexity of Smooth Surfaces of codimension 2
Jeaman Ahn, Sijong Kwak, YeongSeok Song

TL;DR
This paper investigates the degree complexity of smooth surfaces in projective 4-space with respect to the graded lexicographic order, revealing its geometric significance and explicit formulas related to the double curve invariants.
Contribution
It provides a new explicit formula for the degree complexity of smooth surfaces in P^4, linking it to the invariants of the double curve under generic projection.
Findings
Degree complexity relates to the double curve invariants.
Explicit formula for degree complexity for most smooth surfaces.
Exceptional cases where degree complexity equals the degree.
Abstract
D.Bayer and D.Mumford introduced the degree complexity of a projective scheme for the given term order as the maximal degree of the reduced Gr\"{o}bner basis. It is well-known that the degree complexity with respect to the graded reverse lexicographic order is equal to the Castelnuovo-Mumford regularity (\cite{BS}). However, little is known about the degree complexity with respect to the graded lexicographic order (\cite{A}, \cite{CS}). In this paper, we study the degree complexity of a smooth irreducible surface in with respect to the graded lexicographic order and its geometric meaning. Interestingly, this complexity is closely related to the invariants of the double curve of a surface under the generic projection. As results, we prove that except a few cases, the degree complexity of a smooth surface of degree with in is given by…
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
TopicsCommutative Algebra and Its Applications · Algebraic Geometry and Number Theory · Polynomial and algebraic computation
