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 Bounding the Number of Generators for Fat Point Ideals on the Projective Plane
β Scribed by Stephanie Fitchett
- Publisher
- Elsevier Science
- Year
- 2001
- Tongue
- English
- Weight
- 145 KB
- Volume
- 236
- Category
- Article
- ISSN
- 0021-8693
No coin nor oath required. For personal study only.
β¦ Synopsis
Let X be the surface obtained by blowing up general points p 1 p n of the projective plane over an algebraically closed ground field k, and let L be the pullback to X of a line on the plane. If C is a rational curve on X with C β’ L = d, then for every t there is a natural map C C t β X X L β C C t + d given by multiplication on simple tensors. The ranks of such maps are determined as a function of t, d, and m, where m is the largest multiplicity of C at any of the points p i . If I is the ideal defining the fat point subscheme Z = m 1 p 1 + β’ β’ β’ + m n p n β P 2 , and Ξ± is the least degree in which I has generators, then the ranks of the maps C C t β X X L β C C t + d can be used for bounding the number of generators of I in degrees t > Ξ± + 1. Β© 2001 Academic Press
, where P i is the saturated homogeneous ideal defining the point p i . The ideal I is called a fat point ideal, and consists of the homogeneous polynomials in three variables which, for each i, vanish to order at least m i at p i . 502
π SIMILAR VOLUMES
In this paper we determine the Hilbert function and the minimal system of generators of r + 1 β€ n + 1 general fat points of n . Furthermore, by looking at the minimal system of generators we can show that the ideal associated to two fat points in n or the ideal associated to r + 1 β€ n general fat po
In this paper rooted loopless (near) 4-regular maps on surfaces such as the sphere and the projective plane are counted and exact formulae with up to three or four parameters for such maps are given. Several classical results on regular maps and one-faced maps are deduced.
## Abstract The cyclic chromatic number of a plane graph __G__ is the smallest number Ο~__c__~(__G__) of colors that can be assigned to vertices of __G__ in such a way that whenever two distinct vertices are incident with a common face, they receive distinct colors. It was conjectured by Plummer an
In this paper the number of directions determined by a set of q&n points of AG(2, q) is studied. To such a set we associate a curve of degree n and show that its linear components correspond to points that can be added to the set without changing the set of determined directions. The existence of li