Abstract
We give an upper bound for the degree of rational curves in a family that covers a given birationally ruled surface in projective space. The upper bound is stated in terms of the degree, sectional genus and arithmetic genus of the surface. We introduce an algorithm for constructing examples where the upper bound is tight. As an application of our methods we improve an inequality on lattice polygons.
Original language | English (US) |
---|---|
Pages (from-to) | 30-47 |
Number of pages | 18 |
Journal | Journal of Pure and Applied Algebra |
Volume | 223 |
Issue number | 1 |
DOIs | |
State | Published - Jan 2019 |
Externally published | Yes |
Bibliographical note
KAUST Repository Item: Exported on 2021-03-11Acknowledgements: I would like to thank Josef Schicho for useful discussions. This work was supported by base funding of the King Abdullah University of Science and Technology.
This publication acknowledges KAUST support, but has no KAUST affiliated authors.
ASJC Scopus subject areas
- Algebra and Number Theory