Severi dimensions for unicuspidal curves
Abstract.
We study parameter spaces of linear series on projective curves in the presence of unibranch singularities, i.e. cusps; and to do so, we stratify cusps according to value semigroup. We show that generalized Severi varieties of maps with images of fixed degree and arithmetic genus are often reducible whenever . We also prove that the Severi variety of degree- maps with a hyperelliptic cusp of delta-invariant is of codimension at least inside the space of degree- holomorphic maps ; and that for small , the bound is exact, and the corresponding space of maps is the disjoint union of unirational strata. Finally, we conjecture a generalization for unicuspidal rational curves associated to an arbitrary value semigroup.
Key words and phrases:
linear series, rational curves, singular curves, semigroups1991 Mathematics Subject Classification:
Primary 14H20, 14H45, 14H51, 20Mxx1. Introduction
Rational curves are essential tools for classifying complex algebraic varieties. It is less well-known, however, that singular rational curves in projective space are often interesting in and of themselves. Rational curves of fixed degree in are parameterized by an open subset of the Grassmannian ; and singular rational curves arise from special intersections of -dimensional projection centers of rational normal curves with elements of their osculating flags in particular points. Precisely how this arises is often obscure, and in general a singularity is not uniquely determined by the ramification data encoded by these intersection numbers. One of the aims of this paper is to shed light on the conditions beyond ramification that determine a unibranch singularity, and in the process produce a relatively explicit description of the associated parameter spaces of unicuspidal rational curves.
The situation when has been studied extensively, and in this case the geometry is relatively well-behaved. Zariski [12] first established an upper bound for the dimension of any given component of the Severi variety of plane curves of fixed degree and genus , and showed that whenever the upper bound is achieved, a general curve in that component is nodal. Zariski’s result subsequently played an important role in Harris’ celebrated proof [10] of the irreducibility of ; an upshot of their work is that every curve indexed by a point of lies in the closure of the irreducible sublocus of that parameterizes -nodal rational curves. However irreducibility, and the dominating role of the nodal locus, simultaneously fail in a particularly simple way when one replaces by , the “Severi variety” of degree- morphisms of degree and arithmetic genus . Indeed, as we saw in [6], it is easy to construct examples of Severi varieties with components of strictly-larger dimension than that of the -nodal locus as soon as . Each of the excess components produced in [6] parameterizes rational unicuspidal curves for which the corresponding value semigroup is of a particular type, which we christened -hyperelliptic by analogy with Fernando Torres’ -hyperelliptic semigroups [11].
In this paper, we take a closer look at rational unicuspidal curves whose value semigroup is -hyperelliptic. The simplest case is that of , in which the underlying cusps are hyperelliptic, meaning simply that . We show that when , a hyperelliptic cusp of genus imposes at least independent conditions on rational curves of degree in ; moreover, we expect this lower bound to be sharp. This result should be compared against the benchmark codimension of the space of degree- rational curves with (simple) nodes. Our analysis is predicated on a systematic implementation of a scheme for counting conditions associated with cusps described in [6], for which we also give a graphical interpretation at the level of the Dyck path of the corresponding value semigroup. More precisely, our strategy is to fix the local ramification profile, making a linear change of basis if necessary so that the parameterizing functions of our rational curves are ordered according to their vanishing orders in the preimage of the cusp. We can then write down explicitly those conditions beyond ramification that characterize the cusp, and the upshot of this is an explicit dominant rational map from an affine space to each stratum of fixed ramification profile; in particular, each of these strata is unirational.
Going beyond the hyperelliptic case, we give an explicit lower bound for the codimension of the space of unicuspidal rational curves of fixed degree with a -hyperelliptic cusp of genus and of maximal weight, inside the space of all degree- rational curves in . Torres showed that when , such cusps are precisely those with value semigroup . We conjecture that our bound computes the exact codimension of in , and we give some computational as well as qualitative evidence for this. Motivated by our results for -hyperelliptic cusps of maximal weight, we also give a conjectural combinatorial formula for the codimension of the locus of rational curves with cusps of arbitrary type . The existence of such a combinatorial formula, albeit conjectural, aligns with the basic mantra (which we borrow from the study of compactified Jacobians of cusps) that the topology of is controlled by itself. It is also of practical utility. Indeed, we leverage this formula to obtain many new examples of unexpectedly-large Severi varieties associated with -hyperelliptic value semigroups of minimal weight.
The smaller is, however, the more difficult it becomes to produce Severi varieties of codimension strictly less than . Breaking this impasse forced us to rethink our basic organizational protocol for unicuspidal rational curves; and to focus on their stratification according to ramification profile as opposed to value semigroup. Indeed, any Severi variety of codimension strictly less than necessarily contains a generic ramification stratum with the same property. Accordingly, understanding the behavior of the value semigroup attached to a generic parameterization with given ramification profile is crucial. We show that whenever and , the Severi varieties obtained from generic cusps are nearly always of unexpectedly small codimension whenever their ramification profiles comprise sequences of consecutive even numbers. We anticipate that an approach based on limit linear series [9] will show that the same codimension estimates remain operative when we substitute by the space of linear series of degree and rank on a general curve of arbitrary genus whose images have a cusp of type .
1.1. Conventions
We work over . By rational curve we always mean a projective curve of geometric genus zero; at times, it will be convenient to conflate a curve with a morphism that describes its normalization. A cusp is a unibranch (curve) singularity. We denote by the space of nondegenerate morphisms of degree . Here each morphism is identified with the set of coefficients of its homogeneous parameterizing polynomials, so is a space of frames over an open subset of . We denote by the subvariety of morphisms whose images have arithmetic genus . These curves are necessarily singular. Clearly, contains all curves with simple nodes or simple cusps.
In this paper, we will invoke a number of standard tools from linear series and singularities. Accordingly, let be a cusp. Near , the morphism is prescribed by a map of power series, or equivalently, by a map of rings
Let denote the standard valuation induced by the assignment . Let denote the numerical value semigroup of . The -adic valuation computes the vanishing order in of elements of the local algebra of the cusp, so hereafter we will refer to -valuations and -vanishing orders interchangeably. The (local) genus of the singularity at is , and the (global arithmetic) genus of is the sum of all of these local contributions:
We focus exclusively on unicuspidal rational curves, whose singularities are unibranch singletons. Abusively, we will use to refer to the subvariety of that parameterizes unicuspidal genus- rational curves with value semigroup . The variety is further stratified according to the strictly-increasing sequence of vanishing orders in of linear combinations of the local sections that parameterize the cusp. Hereafter, we always assume that . Specifying these vanishing orders is equivalent to specifying a ramification profile that measures their deviation relative to the generic sequence. As a matter of convenience, we will abusively conflate these two notions. Accordingly, we let denote the subvariety of unicuspidal curves with ramification profiles in the preimages of their respective cusps.
It will often be convenient to think of the genus of a cusp as an invariant of the associated numerical semigroup . Similarly, the weight of a cusp is defined in terms of the associated value semigroup by
where denote the elements of .
Given a nonnegative integer , a numerical semigroup is -hyperelliptic if it contains exactly even elements in the interval , and . Note that when , the first condition is vacuous, while the second condition stipulates that : in this situation, is simply hyperelliptic. A useful fact is that every numerical semigroup is -hyperelliptic for a unique value of , i.e., numerical semigroups are naturally stratified according to hyperellipticity degree.
1.2. Roadmap
A more detailed synopsis of the material following this introduction is as follows. In Section 2, we prove Theorem 2.1, which gives a lower bound on the codimension of the locus of rational curves with hyperelliptic cusps as a function of the vanishing orders of the parameterizing functions in the cusps’ preimages. Theorem 2.1 implies that the codimension of the locus of curves with a hyperelliptic cusp of genus is at least ; to prove it, we produce an explicit packet of polynomials in the that impose independent conditions on their coefficients. Roughly speaking, these polynomials are of the simplest possible type suggested by the arithmetic structure of the value semigroup . Proposition 2.5 establishes that whenever , these polynomials generate all nontrivial conditions imposed by a hyperelliptic cusp of genus , and therefore, that the space of rational curves with hyperelliptic cusps has codimension exactly and that each of its subsidiary fixed-ramification strata is unirational in this regime. Our argument is computer-based; however, to obtain a result for all , it would suffice to prove that the pattern detailed in Table 1 persists in general.
In Section 3 we turn our focus to (rational curves with) -hyperelliptic cusps of maximal weight, which naturally generalize the hyperelliptic cusps considered in Section 2. In Theorem 3.1, we obtain an explicit lower bound for the codimension of rational curves with genus- -hyperelliptic cusps of maximal weight, whenever . We use the arithmetic structure of the underlying semigroup to produce an explicit packet of polynomials in the parameterizing functions of our curves, which in turn impose independent conditions on the coefficients of the . We conjecture that these conditions are in fact a complete set of conditions imposed by -hyperelliptic cusps of type, and in Example 3.5 we provide evidence for this; see especially Table 2. Our analysis leads directly to Conjecture 3.6, which gives a value-theoretic prediction for the codimension of in general, whenever this space is nonempty. Our Theorem 3.8 establishes that the prediction made by Conjecture 3.6 for the codimension is at least a lower bound.
In Subsection 3.1, we study (unicuspidal rational curves with) -hyperelliptic value semigroups of minimal weight. These include, in particular, the -hyperelliptic examples studied in [6]. In Proposition 3.11, we exhaustively classify the minimally-ramified strata of such mapping spaces when the target dimension is at most 7, and as a result we find twenty-one new Severi varieties which should be unexpectedly large; we are able to verify this with Macaulay2 in thirteen cases by certifying that our set of conditions is exhaustive, before running out of computing power. These include the first-known examples with six- and seven-dimensional targets. Assuming the validity of Conjecture 3.6, in Proposition 3.13 we produce new infinite families of unexpectedly large Severi varieties in every target dimension (resp., genus) 6 (resp., 21) or larger. In Subsection 3.2, on the other hand, we unconditionally construct infinitely many unexpectedly large Severi varieties from generic cusps with ramification profiles of the form whenever . In particular, our results are optimal in the ambient target dimension. At present we are not able to compute the exact genera of such Severi varieties when ; see Theorem 3.14 for a precise statement. However, when we manage to determine the corresponding generic semigroup (and its genus) explicitly; our Theorem 3.16 shows, in particular, that its genus growth is quadratic in .
1.3. Acknowledgements
We are grateful to Dori Bejleri, Nathan Kaplan, Nathan Pflueger, and Joe Harris for helpful conversations, to the anonymous referee for helpful comments on the exposition, and to Fernando Torres both for initiating the geometric study of the semigroups that bear his name and for his interest in this ongoing project. We dedicate this paper to his memory. The third named author is supported by CNPq grant 305240/2018-8.
2. Counting conditions imposed by hyperelliptic cusps
Cusps form a naturally distinguished (simple) class of singularities. Accordingly, it makes sense to ask for dimension estimates for rational curves with at-worst cusps as singularities. In this section, we prove the following result for unicuspidal rational curves, when the cusps in question are hyperelliptic.
Theorem 2.1.
Given a vector , let . Suppose, moreover, that and , and that ; then
In particular, the variety of rational curves with a unique singularity of hyperelliptic cuspidal type is of codimension at least in .
Remark 2.2.
The condition is imposed by the requirement that our rational curves be nondegenerate, while the condition is an artifact of our method of proof (though likely this assumption may be removed). It is less clear what a reasonable lower threshold for the degree as a function of the genus should be; however, the assumption that includes the (canonical) case in which and . Note that is nonempty if and only if , , and the remaining , belong to .
Proof.
Let denote the image of a morphism corresponding to a point of . Then ramifies at to order
(1) |
and we have
(2) |
in which denotes the number of independent conditions beyond ramification, and the on the right-hand side of (2) arises from varying the preimage of along .
Here we may assume and without loss of generality. In view of (1) and (2), it suffices to show that each , produces at least conditions beyond ramification. We may further suppose that , , since whenever for some , each of the ’s with produces at least ramification conditions. In light of our assumption that this means, in particular, that every is even.
Without loss of generality, we may also assume that , and that the cusp supported in is parameterized by -power series , where
(3) |
for suitable complex coefficients . Note that the power series in (3) is equal to the quotient of the th and th global parameterizing functions introduced previously.
We now recursively define
for every and . The odd number is a gap of the value semigroup of the hyperelliptic cusp, so the coefficient of must vanish. Let denote the polynomial in the coefficients of and associated with the vanishing condition . Those coefficients of that appear in run from to ; and is linear in the variables . It follows that the equations are algebraically independent; and for every , there are independent conditions beyond ramification, as required. ∎
Example 2.3.
In Theorem 2.1, we showed that . In this example we detail the case in which and , in order to show that our lower bound on is often an equality. It will motivate the following two results, and will serve as a template for the proofs of several others. Our strategy is predicated on producing a set of elements in the local algebra of a hyperelliptic cusp that algebraically generate all conditions beyond ramification; we call these -polynomials. To prove that -polynomials algebraically generate the set of conditions beyond ramification, we begin with a “universal” element in the local algebra, thought of as a polynomial in those -tuples of power series that parameterize elements of near their respective cusps. We then argue inductively on the -adic valuations of these power series; as the valuation of necessarily belongs to , gaps of enforce algebraic conditions on the coefficients of the parameterizing series .
More precisely, let and . Near the cusp, the corresponding universal parameterization is defined by power series
Now any is of the form
(4) |
where have -adic valuations less than or equal to , and belongs to the conductor ideal of 111It is well-known that every element of with valuation belongs to , so a decomposition of as in (4) always exists.. In particular, we have
To iteratively produce algebraic constraints beyond ramification, we now argue as follows. If (resp. ) in (4), we immediately deduce that has valuation at least (resp., ), as (resp., ) belongs to and as such is disallowed as a vanishing order. Similarly, terms in the conductor ideal contribute no conditions; so without loss of generality, we may assume that . Accordingly, we may rewrite as
in which each line in the above diagram corresponds to a homogeneous summand of fixed valuation.
We now expand as a power series in . The initial part of the expansion reads
so that if and only if
Accordingly, we set ; and, therefore, the coefficient of above becomes
The
fact that is a gap now forces for every , i.e., that
where ; up to multiplication by constant, this is the unique condition imposed by the fact that .
In
order to capture the essence of the method, we will no longer explicitly record the polynomials but simply mention which coefficients are involved at each step.
In
a second step, we write
and we impose , which in turn allows us to rewrite as
The upshot is that through step two of our procedure, the polynomials are responsible for all of the conditions imposed on the coefficients of the parameterizing functions . Indeed, is the unique condition arising from step one, so the new conditions in step two are and .
More generally, at step of our procedure, we write
and set ; then is forced, and this allows us to rewrite as a linear combination of polynomials in the coefficients of the parameterizing functions .
Referencing the induced decomposition , we call those polynomial conditions produced by (resp., ) as we iterate our procedure -polynomials (resp., -polynomials). The following table gives a precise description of each of these sets of polynomials in the coefficients of the ; the upshot is that the -polynomials are contained in the set of -polynomials.
G-polynomials | H-polynomials | |||||
Gap | ||||||
More precisely, the conditions imposed by the ’s (whose scalar multipliers are the variables , , ) are systematically reproduced (at precisely one later step) by the ’s (whose scalar multipliers are , , ). All available empirical evidence suggests that this same pattern persists for arbitrary values of and ; proving that this holds in general, which in turn would imply a version of Proposition 2.5 without hypotheses on , is an interesting problem.
In Figure 1, we give a graphical interpretation of the conditions imposed by the ’s, i.e., by the polynomials and their inductively derived children , . Graphically speaking, the index specifies a column, while the index specifies a number of upward steps from the Dyck path that codifies the semigroup. This graphical interpretation generalizes naturally to the case of -hyperelliptic cusps, as we will see later (compare Figure 2 below).

Lemma 2.4.
The polynomials of the form impose exactly independent conditions beyond ramification.
Proof.
In the general case, when the parameterizing functions have arbitrary even -vanishing orders, we write
and we set , for all , and . As a shorthand, we will write (resp., ) in place of (resp., in what follows. We then have
(5) | ||||
(6) | ||||
(7) | ||||
(8) | ||||
The
gaps of the semigroup of determine conditions beyond ramification, inasmuch as they may never arise as -vanishing orders of elements of . Our method consists in forcing vanishing to successively higher orders; the steps of the associated process are indexed by gaps of . In the first step we start with the gap , which is the first gap that appears as an exponent in our putative expansion of with generic coefficients. Accordingly we choose
(9) |
in order to eliminate the term of degree . The term of degree now must vanish, which forces
where . In particular, is the unique condition enforced by the gap . Moreover, the coefficient of each monomial appearing in line (5) is computed by a linear form in .
Similarly
, in a second step indexed by the gap , we set
(10) |
in order to eliminate the term of degree . Eliminating the term in degree now forces
which in turn implies that
where is a polynomial on the coefficients of the (parameterizing functions of the) curve. So we obtain 1 additional condition, namely, . Moreover, in light of (10), we see that any coefficient of a monomial appearing in line (6) is computed by a linear form .
More generally,
each step through the th (indexed by the gap ) produces one additional independent condition; and the coefficients of the powers in every line until and including (8) are computed by linear forms .
At
the th step, we set
(11) |
in order to eliminate the term of degree . This, in turn, forces
in order to obtain vanishing in degree . We now obtain
where and are polynomials in the coefficients of (the parameterizing functions of) the curve. So we get 2 additional conditions, namely and . We see, moreover, that every coefficient of a monomial in line (8) is computed by a linear form : indeed, any such coefficient depends a priori on and , but according to (11), depends linearly on the and .
Iterating our selection procedure
ultimately yields at most conditions, generated by the ’s at every step. Here
The argument above shows that the polynomials impose at most algebraically independent conditions beyond ramification. On the other hand, the proof of Theorem 2.1 establishes that there are at least this number of algebraically independent conditions, all imposed by the polynomials and . But as the and are -polynomials, we conclude that the -polynomials impose exactly algebraically independent conditions beyond ramification.
∎
Proposition 2.5.
Let be the variety of rational curves with a unique singularity that is a hyperelliptic cusp. Suppose that and ; then
and each fixed-ramification substratum is unirational of codimension whenever .
Proof.
We verified using Macaulay2 that the set of -polynomials is contained in the set of -polynomials for every whenever ; see [1, ancillary file]. This means, in turn, that the algebra of conditions imposed by hyperelliptic cusps is generated by the leading coefficients of the polynomials introduced in the proof of Theorem 2.1. The unirationality of now follows from the fact that each is linear in the variable of the “universal” parameterization with ramification profile . ∎
Remark 2.6.
The area of the rectangle determined by columns 2 through of our Dyck diagram (of conditions contributing to and ) is precisely , and in our graphical interpretation all of the corresponding boxes are marked; cf. Figure 1.
3. Counting conditions imposed by -hyperelliptic cusps
In this section, using (the proof of) Theorem 2.1 as a template, we establish a lower bound on the number of conditions imposed on rational curves by a -hyperelliptic cusp of genus whose value semigroup is of maximal weight. Fernando Torres proved [11] that whenever , the unique numerical semigroup with this property is .
Theorem 3.1.
Let denote the subvariety consisting of rational curves with a single singularity that is a -hyperelliptic cusp with value semigroup , . Assume as before that , and, moreover, that . Then
where is Dirac’s delta and is either the unique nonnegative integer for which or else .
Remark 3.2.
The hypothesis that is made in order to ensure that , which slightly simplifies the exposition below. Note that , i.e. , is automatic, because is -hyperelliptic by assumption.
Proof.
The analysis required to produce a lower codimension bound is more delicate than in the case, because of the structure of the underlying semigroup . We work locally near a -hyperelliptic cusp of a curve with -vanishing order vector ; that is, belongs to . Without loss of generality, we may assume , , and that for some positive integer . Abusively, hereafter we refer to the local incarnation of as , in which for all , for some local coordinate centered in . The arithmetic structure of interacts with the parameterization underlying via the following device.
Definition 3.3.
Given a distinct set of natural numbers , a decomposition of with respect to is an equation
(12) |
with non-negative integer coefficients . Its underlying partition is . A decomposition as in (12) is reducible whenever some proper sub-sum of the right-hand side of (12) decomposes with respect to ; otherwise it is irreducible.
The following auxiliary notion will also be useful.
Definition 3.4.
Given an element of a numerical semigroup , we set
Case 1:
consists entirely of even integers. As in the case, we have
where is the ramification of , and is the number of independent conditions beyond ramification imposed by on . These conditions beyond ramification are induced by polynomials in the indexed by irreducible decompositions of elements with parts .
Subcase 1.1: . Note that is a multiple of 4 in this range. When , admits a unique irreducible decomposition with respect to , whose underlying partition is ; then gives zero net contribution to the codimension of . Now say for some . Then contributes (at least) independent conditions to . To see this, we begin much as in the case by setting . Then is at least , which belongs to and is thereby precluded. By the same logic, we have
(13) |
where is the smallest element of strictly greater than . Independence of the linear vanishing conditions (13) is clear. On the other hand, once the conditions (13) have been imposed, we have , since the remaining nonzero coefficients of are generic. If , we now iterate this procedure, setting . Replacing by and by yields a set of vanishing conditions analogous to (13). On the other hand, if , then , and we set , whose leading term must vanish. We then iterate by replacing by and subtracting a scalar multiple of any monomial in powers of and with valuation equal to that of (the new version of) . Our procedure continues in this way until all gaps of greater than and less than have been exhausted, and the conditions obtained are algebraically independent; indeed, the linear part of the condition imposed by a given gap is precisely , so new variables appear linearly in the coefficients that are required to vanish at every step.
Our iterative procedure may be interpreted graphically with respect to the Dyck path associated with inside its bounding box. There is a horizontal step in labeled by ; so singles out a column in the Dyck diagram, and is the vertical distance to the top of that column. In particular, we have ; at first glance, it might seem natural to guess that the contribution of to is . Note, in particular, that this contribution is at least , with equality if and only if .
While this is indeed a useful approximation it is not quite correct, as is not realizable as a positive linear combination of . The upshot of this is that it is impossible to continue inductively walking up the Dyck column indexed by simply by adding monomials in to , at each stage, since no monomial in has valuation equal to . Rather, in order to continue ascending the column indexed by “past” , it is necessary to leverage the other columns, and their inductively-constructed polynomials. We will return to this issue momentarily.
Subcase 1.2: and . In this range, again admits either or distinct irreducible decompositions with respect to , depending upon whether belongs to or not. If , then gives zero net contribution to the codimension of ; so without loss of generality we may assume for some . Then has irreducible decompositions with underlying partitions and (resp., ) depending upon whether is divisible by 4 or not. Correspondingly, we define (resp., ). We now inductively “walk” up the column of the Dyck diagram indexed by following the same inductive procedure as in Subcase 1.1. To a first approximation, it is useful to imagine that every gap of strictly greater than imposes a condition that depends linearly on a previously-unseen variable, and there are of these. The precise value of depends on how large is relative to ; writing for some , we have
If is divisible by 4, the linear part of the condition indexed by is as in Subcase 1.1 above; otherwise, the linear part of the condition indexed by is . The aggregate contribution of to is
in which equality holds if and only if , where is either the unique integer for which , or else .
However, just as in Subcase 1.1, the preceding argument needs to be adjusted because is not realizable as a positive sum of , so the iterative procedure by which we walk up the column indexed by needs to be adjusted to explain those conditions induced by gaps greater than . We will implement this adjustment in a unified way across all subcases following our preliminary analysis of Subcase 1.3.
Subcase 1.3: . In this subcase, admits either 3 or 2 distinct irreducible decompositions with respect to , depending upon whether or not belongs to . The underlying partitions are , , and possibly , if for some . Correspondingly we set ; and if , we further set . As before, we inductively walk up the column of the Dyck diagram indexed by , perturbing and by monomials in at each step. The valuations of the resulting polynomials continue inscreasing until they reach , at which stage no further iteration is possible, as no monomial in has valuation equal to . Nevertheless, as a heuristic it is useful to provisionally ignore this obstruction and correct for the overcounting afterwards; in this idealization, each of the (inductively perturbed versions of) and (when ) would contribute algebraically independent conditions, with linear parts of the form and for all , respectively. The value of depends on how large is relative to ; namely,
In this idealization, when , contributes to . When for some , contributes
to , in which the inequality is equality if and only if .
Conditions beyond . Because the minimal generator of does not belong to , no monomial in the parameterizing functions has -valuation . In order to continue ascending the Dyck column indexed by a given element (and a pair of irreducible decompositions of , that we fix at the outset) “beyond” , we perturb the inductively-constructed polynomial of valuation by (any) one of the inductively-constructed polynomials of valuation from a column labeled by a distinct element . More precisely, we replace by and then continue our iterative process just as before, increasing the valuation of our polynomial by adding scalar multiples of monomials in at each step. When we do so for every column labeled by some that admits at least two irreducible decompositions, the net effect is that the lower bound on the codimension predicted by our naive idealization drops by ; cf. Theorem 3.8 and its proof below.
Minimizing the total number of conditions.
Case 2: contains odd entries. Our analysis of conditions imposed by elements is identical to that in Case 1 whenever is even or strictly less than the minimal odd valuation . Note that , and clearly because . The element contributes algebraically independent ramification conditions to . Note that , with equality if and only if and includes all positive elements of less than or equal to . On the other hand, whenever and is odd, admits either 2 or 1 irreducible decompositions with respect to , depending upon whether or not for some . Once more, we may suppose without loss of generality that ; then contributes algebraically independent conditions to . By virtually the same argument as before, the total number of conditions arising from the parameterization is minimized when the valuation entries determine a consecutive sequence of elements in , with the caveat that the unique element eligible to admit 3 irreducible decompositions might be skipped. Given an odd valuation , where , we have and therefore
with equality if and only if , which means precisely that includes all positive elements of less than or equal to .
Aggregating codimension-minimizing conditions. When , every entry of is strictly smaller than . Accordingly, we see that is at least
But, if , is bounded below
We conclude that, whenever ,
.
∎
Example 3.5.
Let , , and , so that is the corresponding -hyperelliptic semigroup of maximal weight; we will show that when is chosen in such a way to minimize the number of conditions in Theorem 3.1, these conditions are in fact exhaustive. To this end, let denote a general element of , where ; and let denote an arbitrary element of . Without loss of generality we may assume, as in Example 2.3, that . We then have
in which the are complex coefficients and the th line in the above diagram corresponds to the homogeneous component of of fixed valuation .
Expanding as a power series in , grouping terms of fixed valuation together, and implementing the method already applied in Example 2.3 and Lemma 2.4, we obtain
at step , and set , which in turn allows us to rewrite as a linear combination of polynomials in the coefficients of the parameterizing functions .
By requiring to vanish to higher and higher order and recording the polynomials obtained at each step, we build the following table, in which the multipliers , and are polynomials in the , and - and -polynomials reference the decomposition , where
G-polynomials | H-polynomials | ||||||
Gap | |||||||
9 | |||||||
11 | |||||||
13 | |||||||
17 | |||||||
21 |
Much as in the hyperelliptic case, the algebra generated by the -polynomials in this example is precisely that generated by the polynomials and distinguished by the inductive process of Theorem 3.1; see Figure 2 for a graphical representation. Inasmuch as every numerical semigroup is -hyperelliptic for some , it seems natural to speculate that an analogous phenomenon persists for arbitrary .

In order to make this precise, we require one additional device, which will correct for possible “syzygetic” redundancies among the polynomials and that will lead to over-counting otherwise. Namely, let denote the nonzero elements of strictly less than the conductor, and let denote the set of partitions underlying irreducible decompositions of , . For each , let denote the exponent vector of the th indexing partition, . Let denote the vector matroid on
Denote the circuits of by and for each , let be the largest semigroup element among for which for some . The syzygetic defect of with respect to is
Finally, given , let , let denote the number of irreducible decompositions with respect to , and let . We always assume the ramification profile in the cusp is fixed in advance.
Conjecture 3.6.
Given a vector , let denote the subvariety parameterizing maps with a unique cusp with semigroup and ramification profile . Let denote the set of minimal generators of strictly less than the conductor that do not appear as entries of ; let ; and suppose . Then
(14) |
Remark 3.7.
Certifying whether is nonempty in general is slightly delicate, inasmuch as it amounts to the assertion that the value semigroup of a general parameterization with ramification profile contains every element of the underlying value semigroup . On the other hand, whenever is nonempty, establishing that its codimension inside is at least the value predicted by the right-hand side of (14) is relatively straightforward.
Theorem 3.8.
Proof.
The argument closely follows that used in proving Theorem 3.1. We start by treating the special case in which every minimal generator belongs to . Accordingly, let denote the “universal” parameterization of , represented by parameterizing functions , . Given , first assume that . Given any two partitions and underlying distinct irreducible decompositions of , the binomial imposes a nontrivial condition on the coefficients of , namely that
(16) |
where denotes the leading coefficient of . Similarly, if , choose an irreducible decomposition of , and set
The crucial point is that
where the quadratic term is nonlinear in the parameterizing coefficients , and will be irrelevant for our purposes. Indeed, if , we obtain a condition, namely , whose linear part closely resembles (16) and involves as-yet unseen variables, namely ; if not, we choose an irreducible decomposition of , and set . Continuing in this way, we inductively walk up the column indexed by in the Dyck diagram associated with the pair , in the process recording the linear parts of the conditions associated with each of the elements of strictly larger than .
Note that these linear parts depend only on the pair of irreducible decompositions of we singled out at the outset. Moreover, if they are linearly independent, then their associated nonlinear conditions are algebraically independent. To push this logic further, let denote the set of partitions underlying irreducible decompositions of , and let denote the th exponent vector, . We now fix a choice of reference exponent vector . Each difference , indexes an initial pair of irreducible decompositions of , and is associated with conditions encountered while inductively walking up the column of the Dyck diagram indexed by . Let denote the span of the vectors , .
Now let denote the nonzero elements of strictly less than the conductor, and let . The set of circuits of the vector matroid referenced in the statement of Conjecture 3.6 indexes a minimal set of linear dependencies among elements of . As a result, the output of our inductive procedure includes redundant linear expressions in the parameterizing coefficients associated with the maximal semigroup element implicated in a given circuit ; and the total number of linearly independent expressions is precisely .
To modify the above argument in the presence of minimal generators , we proceed as follows. Fix a nonzero element for which . Fix the reference irreducible decomposition indexed by as above; let denote the largest element in that belongs to yet is less than ; and let , denote the polynomial with -valuation inductively constructed in the inductive “column-walking” process associated with the decomposition of labeled by . If , there is a single inductive process, labeled by , and it terminates. Otherwise, for we set . We are now left with inductive column-walking processes operative in column , whose associated linear conditions are the linear parts of the coefficients of , of terms with -valuation greater than . For each of these processes, we continue ascending the column indexed by , perturbing by monomials in at each step until either the column is exhausted, or else we produce polynomials with -valuation equal to the largest element that belongs to yet is less than . If , our unique inductive process terminates. Otherwise, for we set and continue proceeding upwards. We conclude by induction on the number of minimal generators of not in . ∎
Example 3.9.
An instructive case is that of and . There are precisely two nonzero elements of for which and , namely and . Theorem 3.8 predicts that the column indexed (resp., ) contributes (resp., ) conditions beyond ramification, where the corrections arise from the minimal generators 25 and 29 that do not belong to . Macaulay2 [1] confirms that Conjecture 3.6 holds in this case, i.e., that the algebraic conditions produced by our iterative procedure and enumerated by Theorem 3.8 are exhaustive.
Remark 3.10.
In every case that we have computed, the exponent vectors , are linearly independent, and thus . It seems likely this is a general feature of sets of irreducible partitions with fixed size. In our context, it implies that syzygetic dependencies only occur among conditions associated with distinct columns in the Dyck diagram.
3.1. Rational curves with -hyperelliptic singularities of minimal weight
One immediate upshot of Theorem 3.1 is that the codimension of a Severi variety is never unexpectedly small, i.e., strictly less than , whenever is equal to the -hyperelliptic semigroup of maximal weight. On the other hand, in [6, Thm 2.3] we produced a particular infinite class of mapping spaces of unexpectedly small codimension; the associated semigroups are -hyperelliptic semigroups of minimal weight, and the projective targets of the underlying parameterizations are of dimension .
More precisely, say that is a -hyperelliptic semigroup of minimal weight, for some . This means precisely that the associated Dyck path is a staircase with steps of unit height and width, or equivalently, that , where
Our result [6, Thm 2.3] establishes that when and , the minimal-ramification stratum is unexpectedly large whenever . It is natural to ask whether fixing while varying the genus and target dimension leads to other excess examples when belongs to the critical interval .
On the other hand, if , then is in fact empty; indeed, no value can be realized by a polynomial in the , if these have valuation vector . Our final result handles the remaining cases, in which and .
Proposition 3.11.
Assume that , , and .Then either is empty, or else
with the following twenty-one exceptions:
-
•
, , and ; or
-
•
, , and .
Of these exceptions, thirteen certifiably underlie Severi varieties with excess components222As we explain below, we can check explicitly with Macaulay2 that the conditions furnished by Theorem 3.8 are in fact exhaustive in all of the exceptional cases for which either or and ..
Proof.
In light of Theorem 2.1 and the discussion above, we may assume . We have
(17) |
while
(18) |
for all . Further note that the set of minimal generators less than the conductor and not belonging to the ramification profile is empty; whenever ; and for every we have
where denotes the number of irreducible decompositions of with respect to . Now let . Applying Theorem 3.8 in tandem with (17) and (18), we are reduced to showing that
(19) |
Our basic strategy, outside of the twenty-one exceptional cases, will be to find values of these for which the associated values of sum to at least (and higher in cases with nonzero syzygetic defect).
Case: .
In light of (17), the estimate (19) follows trivially whenever ; so without loss of generality, we assume . Note that ; indeed, has irreducible decompositions with underlying partitions and . The required estimate (19) follows immediately.
Case: .
This time, we may assume without loss of generality. The estimate (19) follows from the facts that , , and that there are no syzygetic dependencies among the irreducible decompositions of and with underlying partitions , and , , respectively.
Case: .
We may assume without loss of generality. As a result, the right-hand side of (19) is at least
Obtaining the required conditions now depends on the value of itself.
-
•
When , we compute using the facts that when , and that there are no syzygetic dependencies among the irreducible decompositions of 4,5, and 6 with underlying partitions , ; , ; and , , respectively.
-
•
When , we compute using the facts that when , and that there are no syzygetic dependencies among the irreducible decompositions of 6,7, and 8 with underlying partitions ; ; and , respectively.
-
•
When , we compute using the facts that when , and that there are no syzygetic dependencies among the irreducible decompositions of 8,10, and 11 with underlying partitions ; ; and , respectively.
-
•
When , we compute using the facts that when ; in particular, we obtain the required estimate whenever . Now say . Note that , and that there are no syzygetic dependencies among the irreducible decompositions of 12, 13, and 14 with underlying partitions ; ; and , respectively. It follows that the right-hand side of (19) is at least .
Case: .
We may assume ; the right-hand side of (19) is then at least
-
•
When , we compute using the facts that for , , and that the corresponding collection of irreducible decompositions (whose underlying partitions are ; ; and ) has zero syzygetic defect.
-
•
When , we compute using the facts that for , , and that the corresponding collection of irreducible decompositions (whose underlying partitions are ; ; and ) has zero syzygetic defect.
-
•
When , we compute using the facts that for , and that the corresponding collection of irreducible decompositions (with underlying partitions ; ; and ) has zero syzygetic defect. Thus we have produced at least conditions whenever . Assume ; we deduce that the right-hand side of (19) is at least from the facts that , and that the corresponding irreducible decompositions with underlying partitions are independent of the others already listed.
-
•
When , we use the fact that for and that the corresponding irreducible decompositions are independent, i.e. have zero syzygetic defect, to compute , which is strictly less than if and only if . Assume ; using the facts that and and that the collection of irreducible decompositions with underlying partitions ; ; ; and has zero syzygetic defect, we deduce that the right-hand side of (19) is at least .
-
•
When , we use the fact that to compute , which is strictly less than if and only if . Now assume ; we will turn to the (exceptional) cases in a moment. To bound the right-hand side of (19), we use the facts that counts (one minus) the irreducible decompositions with underlying partitions , ; counts the irreducible decompositions corresponding to ; counts the irreducible decompositions corresponding to ; counts the irreducible decompositions corresponding to ; and counts the irreducible decompositions corresponding to . The new wrinkle here is that the syzygetic defect is not zero; rather, there are five nontrivial linear dependencies which together account for a correction of . It follows that the right-hand side of (19) is at least , which is greater than because .
Finally, if , the only irreducible decompositions that are operative are those corresponding to partitions of 15 as above; accordingly, the syzygetic defect is zero and the right-hand side of (19) becomes . Similarly, if , , or , we also allow for decompositions of 16, 17, and 18, and the number of syzygetic linear dependencies is one, two, or four, respectively, so the right-hand side of (19) becomes , , or , respectively. Calculations with Macaulay2 [1] certify that these are the actual codimensions of the corresponding loci .
Case: .
We may assume ; the right-hand side of (19) is then at least
-
•
When , we compute using the facts that for and , and that the corresponding irreducible decompositions with underlying partitions ; ; ; and are independent. In particular, it follows that the right-hand side of (19) is at least .
-
•
When , we count much as in the case. It is easy to see that for and , and that the corresponding collections of irreducible decompositions with underlying partitions ; ; and are independent. It follows that , which is at least when . On the other hand, if we use and that the corresponding irreducible decompositions indexed by are independent of the others to conclude that the right-hand side of (19) is at least .
-
•
When , we compute using the facts that for , , and that the corresponding collections of irreducible decompositions indexed by ; ; and are independent. In particular, we obtain at least conditions whenever . If , we use and the fact that the irreducible decompositions are independent of the others already listed to conclude that the right-hand side of (19) is at least .
-
•
When , we compute using the facts that for and that the corresponding collections of irreducible decompositions indexed by ; ; and are independent. Consequently, we obtain at least conditions whenever . If , there are additional conditions arising from the irreducible decompositions indexed by ; and and counted by and , respectively. These are not independent of the others; rather, there is a single linear relation, which produces a syzygetic defect of . It follows that the right-hand side of (19) is at least .
-
•
When , we compute using the facts that for and that the corresponding collections of irreducible decompositions indexed by and are independent. Consequently, we obtain at least conditions whenever . Now assume . To bound the right-hand side of (19), we use the facts that counts irreducible decompositions indexed by ; counts irreducible decompositions indexed by ; counts irreducible decompositions indexed by ; counts irreducible decompositions indexed by ; and counts irreducible decompositions indexed by . By the same calculation carried out previously when and , the associated syzygetic defect is . It follows that the right-hand side of (19) is at least , which is greater than because .
Similarly, if , the right-hand side of (19) becomes ; while if , , or , it becomes , , or , respectively.
-
•
Finally, when , we use the fact that counts irreducible decompositions of 16 indexed by to compute , which is at least whenever . Now say . To bound the right-hand side of (19), we use the facts that counts irreducible decompositions indexed by , ; counts irreducible decompositions indexed by , , ; counts irreducible decompositions indexed by , , ; counts irreducible decompositions indexed by , , , ; counts irreducible decompositions indexed by , , , ; counts irreducible decompositions indexed by , , , ; and counts irreducible decompositions indexed by , , , .333In the last case, the fact that is two less than the number of underlying partitions arises because the decomposition is reducible. It is, moreover, easy to check that for every integer , there is exactly one irreducible decomposition of counted by that is independent of the irreducible decompositions counted by , , …, . It follows that the right-hand side of (19) is at least
which is greater than precisely when . Furthermore, it is easy to check explicitly that no irreducible decomposition of counted by is independent of the irreducible decompositions counted by , , …, for integers , so Conjecture 3.6 predicts that the codimension of is precisely for all .
∎
Remark 3.12.
We suspect that Conjecture 3.6 should persist for arbitrary choices of algebraically-closed base fields, in the same way that the irreducibility of the classical Severi variety of plane curves persists [4]. If true, this should be easy to verify in each instance for which Conjecture 3.6 may be checked by computer.
To close this subsection, we show how to modify the construction of [6, Thm 2.3] to obtain new infinite families of Severi varieties of unexpectedly small codimension, assuming the validity of Conjecture 3.6.
Proposition 3.13.
Let denote the (generic stratum of a) Severi variety with underlying value semigroup as above. Now assume that , , and that (resp., ) for some nonnegative integer . Assume that Conjecture 3.6 holds; then is of codimension (resp., ) in . In particular, is of codimension strictly less than in .
Proof.
Assuming that Conjecture 3.6 holds, the right-hand side of (19) computes the codimension of in .
Case: .
The right-hand side of (19) is equal to
The desired conclusion in this case follows immediately from the facts that for , while for . The fact that , in particular, is clear.
Case: .
This time, the right-hand side of (19) is equal to
We use the facts that for , while counts the irreducible decompositions indexed by ; counts the irreducible decompositions indexed by ; counts the irreducible decompositions indexed by ; and counts the irreducible decompositions indexed by . The two linear dependencies among these together account for , and the desired conclusion follows. ∎
3.2. Generic cusps with ramification ,
In this subsection, we study the value semigroup of a generic singularity with ramification profile equal to an -tuple of consecutive even numbers. Whenever , we are not able to determine explicitly; we still manage to show, however, that its structure forces the associated Severi variety to be unexpectedly large in general. When , we are able to determine explicitly and show that is usually unexpectedly large as a result.
Theorem 3.14.
Given positive integers and , let denote the value semigroup of a generic cusp in with ramification profile . We then have
where denotes the complement of .
Proof.
Fix a choice of generic -tuple of power series with ramification profile in ; without loss of generality, we may assume each of the parameterizing functions has a monic lowest-order term. The generic value semigroup comprises all valuations realized by polynomials in the , . It follows immediately that . Similarly, we have
as the minimal valuation realized by a nonlinear polynomial in the is . (Note that the latter equality is a consequence of genericity.) To conclude, it suffices to see that no element belonging to is the valuation of a quadratic polynomial in the ; indeed, by genericity, the largest odd valuation realized by such a quadratic polynomial is . ∎
For our purposes, the crucial take-away of Theorem 3.14 is the following.
Corollary 3.15.
For every pair of positive integers and , the corresponding Severi variety is of codimension strictly less than in whenever .
Proof.
By genericity, the only conditions imposed on holomorphic maps by arise from ramification in the preimage of the cusp, and there are
of these. On the other hand, Theorem 3.14 implies that
where is the delta-invariant of a generic cusp with ramification . Accordingly, it suffices to check that
(20) |
and this is ensured by our numerical hypotheses on and . ∎
When , we have to work harder to produce unexpectedly large Severi varieties; indeed, the inequality (20) never holds. To do so, we exploit a natural connection between generators of and solutions to linear diophantine equations that is particular to the case.
Theorem 3.16.
For every positive integer , the value semigroup of a generic parameterization with ramification profile is equal to (resp., ) if is even (resp., odd). In particular, is of genus (resp.,) if is even (resp., odd).
Proof.
Let denote a generic power series map with ramification profile in ; then is a power series with -adic valuation , . Now assume that is even. We begin by showing that . Without loss of generality, assume that each has a monic term of lowest order. Genericity then implies that belongs to . That is to say, the fact that arises because the diophantine equation admits a triple of nonnegative solutions . Similarly, the diophantine equation admits nonnegative solutions , which implies that belongs to . It follows that .
Note that the gap set is given by
We now claim that no element is the valuation of a polynomial in the parameterizing functions , . Indeed, this is clear for every , as every such is strictly less than every ; as well as for every , since by construction is the minimally realizable odd valuation. Similarly, our construction shows that each of the remaining elements , if equal to the valuation of a polynomial in the , is necessarily the valuation of the sum of at most two monomials in the (since there are no “triple ties” among valuations of monomials in this range). Moreover, since no belongs to , this means that any realizable is necessarily the valuation of the sum of two monomials with equal valuation . Genericity of the then forces to be , where is a multiple of ; as no fits this description, it follows that when is even. As a result, has genus
Assume now that is odd. Once again, belongs to , as does ; so . In this case the gap set is
An argument analogous to that used in the case of even shows that no element of is the valuation of a polynomial in the , which enables us to conclude that . As a result, has genus
∎
Corollary 3.17.
For every positive integer , the corresponding Severi variety is of codimension strictly less than in whenever .
Proof.
By genericity, the only conditions imposed on holomorphic maps of degree by arise from ramification in the preimage of the cusp; and there are of these. In light of Theorem 3.16, it therefore suffices to show that
which is guaranteed by our hypothesis on . ∎
Remark 3.18.
We expect that the codimension estimates we have obtained for Severi varieties of rational unicuspidal curves, i.e., for linear series on with unicuspidal images, hold more generally for (varieties of) linear series on general curves of arbitrary genus. Indeed, to establish the algebraic independence of conditions imposed by cusps on linear series on a given smooth curve , it suffices to certify that certain evaluation maps from (sections of) line bundles to their associated jet bundles are surjective, and this is easy when is either rational or elliptic. On the other hand, when is general, it specializes in a flat family to a stable union of rational and elliptic curves; and it is possible to explicitly relate the variety of linear series on to the variety of limit linear series [9] on . To complete this argument, we would need a suitable generalization of the notion of “cusp” for limit linear series.
References
- [1] E. Cotterill, V.L. Lima, and R.V. Martins, ancillary file for Severi dimensions for unicuspidal curves, https://sites.google.com/view/singular-rational-curves.
- [2] M. Bras-Amorós and A. de Mier, Representation of numerical semigroups by Dyck paths, Semigroup Forum 75 (2007), no. 3, 676–681.
- [3] J. Buczynski, N. Ilten, and E. Ventura, Singular curves of low degree and multifiltrations from osculating spaces, IMRN 2020 (2020), issue 21, 8139–8182.
- [4] K. Christ, X. He, and I. Tyomkin, On the Severi problem in arbitrary characteristic, arXiv:2005.04134.
- [5] E. Cotterill, L. Feital, and R.V. Martins, Singular rational curves in via semigroups, arXiv:1511.08515v1.
- [6] E. Cotterill, L. Feital, and R.V. Martins, Dimension counts for cuspidal rational curves via semigroups, Proc. AMS 148 (2020), 3217–3231.
- [7] E. Cotterill, L. Feital, and R.V. Martins, Singular rational curves with points of nearly-maximal weight, J. Pure Appl. Alg. 222 (2018), 3448-3469.
- [8] D. Eisenbud and J. Harris, Divisors on general curves and cuspidal rational curves, Invent. Math. 74 (1983), no. 74, 371–418.
- [9] D. Eisenbud and J. Harris, Limit linear series: basic theory, Invent. Math. 85 (1986), 337–371.
- [10] J. Harris, On the Severi problem, Invent. Math. 84 (1986), 445–461.
- [11] F. Torres, On -hyperelliptic numerical semigroups, Semigroup Forum 55 (1997), 364–379.
- [12] O. Zariski, Dimension-theoretic characterization of maximal irreducible algebraic systems of plane nodal curves of a given order n and with a given number d of nodes, Amer. J. Math. 104 (1982), no. 1, 209–226.