On Weierstrass semigroups of double coverings of genus three curves

Let C be a complete non-singular curve of genus 3 over an algebraically closed field of characteristic 0. We determine all possible Wierstrass semigroups of ramification points on double coverings of C whose covering curves have genus greater than 8. Moreover, we construct double coverings with ramification points whose Weierstrass semigroups are the possible ones.     

On Weierstrass semigroups of double covering of genus two curves

In this work we prove that are Weierstrass semigroups all numerical semigroups whose three first positive non-gaps are 6, 8 and 10, resolving the problem of the numerical semigroups that appear as Weierstrass semigroups in double coverings of genus two curves.     

Fibonacci-like behavior of the number of numerical semigroups of a given genus

We conjecture a Fibonacci-like property on the number of numerical semigroups of a given genus. Moreover we conjecture that the associated quotient sequence approaches the golden ratio. The conjecture is motivated by the results on the number of semigroups of genus at most 50. The Wilf conjecture has also been checked for all numerical semigroups with genus in the same range.     

Constructing numerical semigroups of a given genus

Let n _g denote the number of numerical semigroups of genus g. Bras-Amorós conjectured that n _g possesses certain Fibonacci-like properties. Almost all previous attempts at proving this conjecture were based on analyzing the semigroup tree. We offer a new, simpler approach to counting numerical semigroups of a given genus. Our method gives direct constructions of families of numerical semigroups, without referring to the generators or the semigroup tree. In particular, we give an improved asymptotic lower bound for n _g .     

The set of numerical semigroups of a given genus

In this paper we present a new approach to construct the set of numerical semigroups with a fixed genus. Our methodology is based on the construction of the set of numerical semigroups with fixed Frobenius number and genus. An equivalence relation is given over this set and a tree structure is defined for each equivalence class. We also provide a more efficient algorithm based on the translation of a numerical semigroup to its so-called Kunz-coordinates vector.     

On Crawley Modules

A curve Xis said to be of type (iV, γ) if it is an iV-sheeted covering of a curve of genus γ with at least one totally ramified point. A numerical semigroup His said to be of type (iV, γ) if it has γ positive multiples of Nin [N, 2N_J] such that its γth element is 2Nγ and (2γ+1)NεH. If the genus of X is large enough and N is prime, X is of type (TV, γ) if and only if there is a point P6 X such that the Weierstrass semigroup at P is of type (N, γ) (this generalizes the case of double coverings of curves). Using the proof of this result and the Buchweitz's semigroup, we can construct numerical semigroups that cannot be realized as Weierstrass semigroups although they might satisfy Buchweitz's criterion     

Weierstrass semigroups whose minimum positive integers are even

We consider three subsets of the set of 2n-semigroups, where for a positive integer n a 2n-semigroup means a numerical semigroup whose minimum positive integer is 2n. These three subsets are obtained by the Weierstrass semigroups of total ramification points on a cyclic covering of the projective line, the Weierstrass semigroups of ramification points on a double covering of a non-singular curve and the Weierstrass semigroups of points on a non-singular curve. We show that the three subsets are different for n ≧ 3. Partially supported by Grant-in-Aid for Scientific Research (17540046), Japan Society for the Promotion of Science. Received: 19 June 2006     

The ordinarization transform of a numerical semigroup and semigroups with a large number of intervals

A numerical semigroup is said to be ordinary if it has all its gaps in a row. Indeed, it contains zero and all integers from a given positive one. One can define a simple operation on a non-ordinary semigroup, which we call here the ordinarization transform, by removing its smallest non-zero non-gap (the multiplicity) and adding its largest gap (the Frobenius number). This gives another numerical semigroup and by repeating this transform several times we end up with an ordinary semigroup. The genus, that is, the number of gaps, is kept constant in all the transforms.This procedure allows the construction of a tree for each given genus containing all semigroups of that genus and rooted in the unique ordinary semigroup of that genus. We study here the regularity of these trees and the number of semigroups at each depth. For some depths it is proved that the number of semigroups increases with the genus and it is conjectured that this happens at all given depths. This may give some light to a former conjecture saying that the number of semigroups of a given genus increases with the genus.We finally give an identification between semigroups at a given depth in the ordinarization tree and semigroups with a given (large) number of gap intervals and we give an explicit characterization of those semigroups.     

Fibonacci-like growth of numerical semigroups of a given genus

We give an asymptotic estimate of the number of numerical semigroups of a given genus. In particular, if n _g is the number of numerical semigroups of genus g, we prove that $$\lim_{g \rightarrow \infty} n_g \varphi^{-g} = S $$ where $\varphi = \frac{1 + \sqrt{5}}{2}$ is the golden ratio and S is a constant, resolving several related conjectures concerning the growth of n _g . In addition, we show that the proportion of numerical semigroups of genus g satisfying f<3m approaches 1 as g→∞, where m is the multiplicity and f is the Frobenius number.     

On the enumeration of the set of saturated numerical semigroups of a given genus

In this paper we present an algorithm for computing the set of saturated numerical semigroups of a given genus. We see how the set of saturated numerical semigroups can be arranged in a tree rooted in \(\mathbb{N}\) and we describe the sons of any vertex of this tree.     

Bounds on the number of numerical semigroups of a given genus

Lower and upper bounds are given for the number n_g of numerical semigroups of genus g. The lower bound is the first known lower bound while the upper bound significantly improves the only known bound given by the Catalan numbers. In a previous work the sequence n_g is conjectured to behave asymptotically as the Fibonacci numbers. The lower bound proved in this work is related to the Fibonacci numbers and so the result seems to be in the direction to prove the conjecture. The method used is based on an accurate analysis of the tree of numerical semigroups and of the number of descendants of the descendants of each node depending on the number of descendants of the node itself.     

Gorenstein Curves with Quasi-Symmetric Weierstrass Semigroups

We consider a canonical Gorenstein curve C of arithmetic genus g in P g-1 (K), that admits a non-singular point P, whose Weierstrass semigroup is quasi-symmetric in the sense that the last gap is equal to 2g-2. By making local considerations at the point P and the second point of the curve C on its osculating hyperplane at P we construct monomial bases for the spaces of higher order regular differentials. We give an irreducibility criterion for the canonical curve in terms of the coefficients of the quadratic relations. We also realize each quasi-symmetric numerical semigroup as the Weierstrass semigroup of a reducible canonical Gorenstein curve, but we give examples of such semigroups that cannot be realized as Weierstrass semigroups of smooth curves.     

The arithmetic extensions of a numerical semigroup

Abstract

In this paper we introduce the notion of extension of a numerical semigroup. We provide a characterization of the numerical semigroups whose extensions are all arithmetic and we give an algorithm for the computation of the whole set of arithmetic extension of a given numerical semigroup. As by-product, new explicit formulas for the Frobenius number and the genus of proportionally modular semigroups are obtained.     

Numerical computation of the genus of an irreducible curve within an algebraic set

The common zero locus of a set of multivariate polynomials (with complex coefficients) determines an algebraic set. Any algebraic set can be decomposed into a union of irreducible components. Given a one-dimensional irreducible component, i.e. a curve, it is useful to understand its invariants. The most important invariants of a curve are the degree, the arithmetic genus and the geometric genus (where the geometric genus denotes the genus of a desingularization of the projective closure of the curve). This article presents a numerical algorithm to compute the geometric genus of any one-dimensional irreducible component of an algebraic set.     

The maximum proportionally modular numerical semigroup with given multiplicity and ratio

We prove that the set of all proportionally modular numerical semigroups with fixed multiplicity and ratio has a maximum (with respect to set inclusion). We show that this maximum is a maximal embedding dimension numerical semigroup, for which we explicitly calculate its minimal system of generators, Frobenius number and genus.     

The orbifold cohomology of moduli of genus 3 curves

In this work we study the additive orbifold cohomology of the moduli stack of smooth genus g curves. We show that this problem reduces to investigating the rational cohomology of moduli spaces of cyclic covers of curves where the genus of the covering curve is g. Then we work out the case of genus g =  3. Furthermore, we determine the part of the orbifold cohomology of the Deligne–Mumford compactification of the moduli space of genus 3 curves that comes from the Zariski closure of the inertia stack of ${\mathcal{M}3}$ .     

Ramification points of double coverings of curves and Weierstrass points

Summary Let π: X→C be a double covering with X smooth curve and C elliptic curve. Let R(π)⊂X be the ramification locus of π. Every P∈R(π) is a Weierstrass point of X and we study the triples (C, π, X) for which the set of corresponding Weierstrass points have certain semigroups of non-gaps. We study the same problem also for triple cyclic coverings of C. Entrata in Redazione il 17 luglio 1998. The authors were partially supported by MURST and GNSAGA of CNR (Italy).     

Order,genus, and diagram invariance

The genus of any ordered set equals the genus of its covering graph, and, therefore, the genus of an ordered set is a diagram invariant.