2011/11/27 by Dung Tien Nguyen, Dung Nguyen, Nguyen, Dung
Computer Science · Mathematics · #14-XX #Algebraic Geometry (math.AG) #Algebraic Geometry and Number Theory #Cryptography and Residue Arithmetic #FOS: Mathematics #Polynomial and algebraic computation #math.AG #msc:14-XX
paper · pdf · doi:10.48550/arxiv.1111.6296
1 figure
openalex publication_date 2011/11/27 · arxiv created 2011/11/30 · arxiv updated 2011/12/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
We solve the problem of computing characteristic numbers of rational space curves with a cusp, where there may or may not be a condition on the node. The solution is given in the form of effective recursions. We give explicit formulas when the dimension of the ambient projective space is at most 5. Many numerical examples are provided. A C++ program implementing most of the recursions is available upon request