𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On the number of the cusps of cuspidal plane curves

✍ Scribed by Keita Tono


Publisher
John Wiley and Sons
Year
2005
Tongue
English
Weight
125 KB
Volume
278
Category
Article
ISSN
0025-584X

No coin nor oath required. For personal study only.

✦ Synopsis


Abstract

In this paper, we estimate an upper bound of the number of the cusps of a cuspidal plane curve. We prove that a cuspidal plane curve of genus g has no more than (21__g__ +17)/2 cusps. For example, a rational cuspidal plane curve has no more than 8 cusps and an elliptic one has no more than 19 cusps. (Β© 2005 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)


πŸ“œ SIMILAR VOLUMES


On the Number of Cyclic Projective Plane
✍ John Konvalina πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 141 KB

An explicit formula for the number of finite cyclic projective planes or planar . Ε½ . difference sets is derived by applying Ramanujan sums Von Sterneck numbers and Mobius inversion over the set partition lattice to counting one-to-one solution vectors of multivariable linear congruences.

Embeddings of Curves in the Plane
✍ Vladimir Shpilrain; Jie-Tai Yu πŸ“‚ Article πŸ“… 1999 πŸ› Elsevier Science 🌐 English βš– 88 KB

## w x Let K x, y be the polynomial algebra in two variables over a field K of characteristic 0. In this paper, we contribute toward a classification of two-variable Ε½ w x. polynomials by classifying up to an automorphism of K x, y polynomials of the e., polynomials whose New- . ton polygon is e

The Convex Hull of Rational Plane Curves
✍ Gershon Elber; Myung-Soo Kim; Hee-Seok Heo πŸ“‚ Article πŸ“… 2001 πŸ› Elsevier Science 🌐 English βš– 220 KB

We present an algorithm that computes the convex hull of multiple rational curves in the plane. The problem is reformulated as one of finding the zero-sets of polynomial equations in one or two variables; using these zero-sets we characterize curve segments that belong to the boundary of the convex

The Number of Plane Corner Cuts
✍ Sylvie Corteel; GaΓ«l RΓ©mond; Gilles Schaeffer; Hugh Thomas πŸ“‚ Article πŸ“… 1999 πŸ› Elsevier Science 🌐 English βš– 61 KB

In this article we give a generating function for the number # 2 n cut of plane corner cuts with respect to their size and prove that there exist two positive constants c and c such that, for all n > 1, We rely on [Onn-Sturmfels] for motivations for this work and we simply recall the following defi

Determinantal Formula for the Cuspidal C
✍ Fumio Hazama πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 313 KB

An integer matrix whose determinant computes the cuspidal class number of the modular curve X 1 (m) is obtained. When m is an odd prime, this will provide us with an upper bound of the class number.