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.
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
## 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
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
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
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.