Abstract
Suppose that the adjusted Brill–Noether number is zero; we prove that there exists a family of twice-marked smooth projective curves such that the family of linear series with two imposed ramification conditions is irreducible. Moreover, under certain conditions, we show that the monodromy group contains the alternating group. In the case , the monodromy group is the full symmetric group.
MSC:
14H10
1. Introduction
Let C be a smooth projective curve of genus g over ; then, all the linear series of degree d and rank r on C form a projective moduli space , which is known as the Brill–Noether locus. The classical Brill–Noether theorem [1] states that, if C is a general projective curve and the Brill–Noether number
then is a smooth variety of dimension exactly [2]. Moreover, if , the variety is also irreducible.
Eisenbud and Harris [3] considered the analogy of such irreducibility when . If , then the variety is reducible and precisely consists of
reduced points. However, if we consider a family of curves , the corresponding family of linear series may be irreducible. Eisenbud and Harris proved the following theorem:
Theorem 1
([3], Theorem 1). There exists a family of smooth projective curves such that is irreducible.
In this paper, we generalize this theorem to the case of linear series with imposed ramification conditions at two generic points. Let be two ramification sequences. Given a smooth projective curve C and two distinct points on C, all the linear series of degree d and rank r on C with ramification sequence at least at p and at least at q also form a projective moduli space [4]. Eisenbud and Harris [4] proved that if C is a general projective curve, then has dimension exactly
which is often called the adjusted Brill–Noether number.
Now we consider the case of . In this case, consists of precisely reduced points. We will prove the following theorem:
Theorem 2
(Theorem 8). Let be two ramification sequences, and suppose
Then there exists a family of twice-marked smooth projective curves such that the corresponding is irreducible.
Moreover, we can demonstrate that, in some cases, the monodromy group of the family given in the proof of Theorem 2 is at least the alternating group. This result also generalizes Edidin’s theorem ([5], Theorem 2).
Theorem 3
(Theorem 11, Proposition 5). Given two ramification sequences . Suppose
Let . If satisfy the conditions of Lemma 3, then the monodromy group of in Theorem 2 is either the alternating group or the symmetric group . Moreover, if , then the monodromy group is .
Brill–Noether loci with fixed ramification have been studied in some studies in the literature, such as [6,7,8].
1.1. Notational Conventions
We mention some conventions that will be used throughout this paper.
- (1)
- The numbers will always be non-negative and satisfy .
- (2)
- The symbols , will refer to vanishing sequences of a linear series. The numbers and will be in increasing order. The symbols , will refer to the corresponding ramification sequences of a linear series, defined by , . The numbers and will be in non-increasing order.
1.2. Structure of This Paper
In Section 2, we provide the necessary background on limit linear series. Section 3 explores the combinatorics of limit linear series and monodromy actions on a certain reducible curve. In Section 4, we prove the irreducibility result and establish some technical combinatorial lemmas. Finally, in Section 5, we prove our main results about monodromy groups.
2. Preliminaries
Let C be a smooth projective curve over .
Definition 1.
A linear series on a curve C of degree d and rank r is a pair , where is a line bundle of degree d on C, and V is an -dimensional subspace of .
A linear series of degree d and rank r is historically denoted as .
For any linear series, we can define its vanishing sequence and ramification sequence at each point.
Definition 2.
Let be a on a curve C. For any , the vanishing sequence of at p is the increasing sequence of orders of sections in V at the point p:
and the corresponding ramification sequence is the non-increasing sequence
where .
If for all , then p is called a non-ramification point; otherwise, it is a ramification point.
Some studies in the literature define the ramification sequence as a non-decreasing sequence, i.e., . Here, to match with Schubert indices later on, we define it as a non-increasing sequence. We say a linear series has ramification at least at p if its ramification sequence at p is greater than or equal to term by term.
The following theorem is a generalization of the Brill–Noether theorem, proved by Eisenbud and Harris.
Theorem 4
([4], Theorem 4.5). Given and ramification sequences for each , let
Then, for all smooth projective curves C of genus g, and distinct marked points , there is a projective moduli space of ’s on C with ramification at least at each , and it has every component of dimension at least ρ if it is non-empty. On a general curve C of genus g, the space of ’s has dimension exactly ρ, and, in particular, is empty if .
2.1. Limit Linear Series
The original proofs of the Brill–Noether theorem [1], along with many other results, relied on analyzing linear series on smooth curves and studying their degeneration to singular curves. Later, Eisenbud and Harris [4] developed the theory of limit linear series, which describes how linear series specialized as smooth curves degenerate into curves of compact type. This theory, known for its ability to characterize the behavior of linear series under degenerations, has become a powerful tool in algebraic geometry.
A (possibly) reducible curve C is of compact type if its Jacobian is compact, or equivalently, if its irreducible components are smooth and meet transversely at a time and its dual graph obtained by considering the components as vertices and intersection relationships as edges is a tree.
Definition 3.
Let C be a curve of compact type. For each irreducible component Y of C, let be a on Y. If the collection
satisfies, for any two irreducible components Y and Z of C with , and for any , we have
then L is called a crude limit linear series of degree d and rank r on C. If all these inequalities are equalities, then L is called a refined limit linear series, or, simply, a limit linear series, on C.
If L is a crude limit linear series but not refined, we call L a strictly crude limit linear series.
Eisenbud and Harris constructed a scheme parameterizing linear series and limit linear series for any smoothing family [4], and concluded the following:
Theorem 5
([4], Theorem 3.3). Let be an (n-pointed genus-g curve) smoothing family and be ramification sequences. Let
Then, there is a quasiprojective scheme parameterizing linear series on smooth fibers of , and limit linear series on singular fibers of , both of degree d and dimension r, and having ramification at least at each for . The dimension of any component of G is at least .
If either
or no reducible fibers of have strictly crude ’s with the prescribed ramifications, then G is proper over B.
It is also worth noting that Osserman developed a functorial construction for limit linear series and provided a systematic framework to generalize the classical theory of limit linear series to all nodal curves (see [9,10]).
2.2. Linear Series on and Schubert Cycles
It is well known that linear series of degree d and rank r on correspond to -dimensional subspaces of . Let be the Grassmannian parameterizing all -dimensional subspaces of , or equivalently, all r-dimensional subspaces of .
Ramification sequences of linear series on are closely connected to Schubert indices. For any point , we define subspaces
These subspaces form a complete flag in . For a Schubert index satisfying
we define the associated Schubert cycle in the Grassmannian as
which is a subvariety of codimension . The relationship between ramification sequences and Schubert varieties can be expressed as follows:
Proposition 1.
If is a linear series on , then its ramification sequence at point q is greater than or equal to term by term if and only if .
Proof.
The proof is straightforward. Suppose the vanishing sequence of at q is and the corresponding ramification sequence is . On the other hand, let be the corresponding vanishing sequence of . Then we have
□
Let denote distinct points of and represent ramification sequences associated with these points. An important fact that we will frequently use, which can be found in [11], is that the intersection has the expected codimension .
3. Limit Linear Series with Two Imposed Ramifications
As in [3], we prove our results by degenerating smooth curves into reducible nodal curves, leveraging the combinatorial representations of limit linear series on such curves. A commonly used degeneration method involves chains of elliptic and rational curves. Specifically, we examine a twice-marked reducible nodal curve , which is the same as the one discussed in [3], as illustrated in Figure 1.
Figure 1.
Curve .
Here, are rational curves isomorphic to , are elliptic curves attached to , and , are the marked points. To ensure the stability of , we may label an additional point on , although for simplicity of notation, we temporarily omit it. Later, we will provide a detailed description of all limit linear series on with ramification sequences at least at and at least at .
To investigate the monodromy action on the limit linear series of the curve , we can examine some one-parameter families where each curve also takes the form of chains of elliptic and rational curves. For any , we consider the one-parameter family , where as p approaches infinity, the stable limit of is . The curve is depicted in Figure 2.
Figure 2.
Curve .
The curve differs from in that it excludes the rational curve and instead attaches the elliptic curve to . In terms of coordinates on , the intersection points of , and with are , and ∞, respectively, where . As p tends to infinity, the stable limit of the curves results in the blow-up of the curve at , precisely adding another rational curve , which is exactly the curve .
3.1. Combinatorial Representation of Limit Linear Series on and
Next, we study the combinatorial representation of limit linear series with ramification conditions at the given two points on the curves and . We will utilize some results from [3], and for convenience, we include relevant propositions here. The curves and primarily have only two distinct local types, denoted as D and , as shown in Figure 3.
Figure 3.
Curves D and .
Let L be a limit on the curve D. Then, L consists of linear series on the two irreducible components of D: and . We denote the vanishing sequence of at as and at as , corresponding to ramification sequences and , respectively. Furthermore, let denote the dual ramification sequence of , where for any ,
For the curve , we use the same notation. Then, the limit linear series on D and can be characterized as follows:
Lemma 1
([3], Corollary 1.2). We have:
- 1.
- On the curve D, it holds that . If equality holds, then , is the image of in , and there exists a unique i such thatand for any ,Conversely, given vanishing sequences and satisfying these conditions, there exists a unique limit on D such that the vanishing sequences at and are, respectively, and .
- 2.
- On the curve , it holds that . If the equality holds, then the linear series and of the elliptic curve parts are determined in the same way as D.Given vanishing sequences and such that the corresponding ramification sequences satisfy , there is at most one limit on with these sequences except in the following case, where there are either 1 or 2 such series. There exist integers such that the following are true:
- (1)
- If , then ;
- (2)
- ;
- (3)
- ;
- (4)
- ;
- (5)
- For any , .
Using this lemma, we can fully characterize limit linear series on and with the imposed ramification conditions and at and , respectively. Let L be such a limit on , then the restriction of L on each part remains a limit . Suppose the vanishing sequence and the ramification sequence of at are and , respectively. According to Lemma 1, for any , we have
which leads to
On the other hand, to ensure the intersection is nonempty, it is required that
While at the beginning we assume
so that
By combining inequalities (1) and (2), we deduce that all the equalities must hold. Thus, and for any , .
For the curve , we use the same notation. For any and , we have
and
Consequently,
Similarly, in this case, the inequality (2) also holds, confirming that these inequalities are all equalities. Therefore, and for any where , it must be that and .
In summary, a limit linear series satisfying ramification at least at and at least at L on the curve corresponds to a chain of Schubert cycles:
where is the Poincaré dual of . This correspondence is indeed one-to-one, which we formulate as the following theorem:
Theorem 6.
Suppose are two ramification sequences and
Let Σ be the set of sequences of Schubert cycles in :
such that for any :
Then, the limit linear series on the curve satisfying the ramification sequences at , being at least α, β, respectively, correspond bijectively to Σ, where the limit linear series L corresponds to as given in Equation (3).
Proof.
As discussed above, the limit linear series L corresponds to a chain of Schubert cycles . For any , let the restriction of L on the rational curve be . The ramification sequences of at and its intersection with are , respectively, where is the Schubert index of . The existence of such implies
hence, the sequence
belongs to Σ.
Conversely, given a sequence in Σ:
such that for any ,
then by Lemma 1 (1), there exists a unique limit linear series L on such that its ramification sequences at points , are , , respectively. □
Combinatorics in Schubert calculus is often represented by Young tableaux. Here, we can also transform such sequences of Schubert cycles into Young tableaux, making it easier to handle the combinatorics. This approach is particularly useful for studying monodromy actions. Bercov and Proctor [12] were the first to use Young tableaux to parameterize limit linear series. Now, we restate Theorem 6 using Young tableaux.
Given ramification sequences and , we construct a (skew) Young diagram as shown in Figure 4. We place the sequence from bottom to top on the left side of an rectangle, while the sequence from top to bottom on the right side. The reversal of is due to the fact that the last term in the sequence of Schubert cycles as above is the Poincaré dual of . The assumption implies that the entire Young diagram consists of g boxes.
Figure 4.
Young diagram corresponding to limit linear series on .
We have the following theorems.
Theorem 7.
Let α and β be two ramification sequences, and suppose
Then, the limit linear series on the curve with ramification sequences at and at least α and β correspond bijectively to the Young tableaux of the Young diagram .
Proof.
By Theorem 6, limit linear series on correspond bijectively to sequences in Σ. Let be a sequence in Σ. We now construct the corresponding Young tableau inductively.
Suppose and the integers have already been filled in the Young diagram . According to Lemma 1, there exists a unique such that . To proceed, we fill k into the first available empty box from the left in the -th row. The existence of this empty box is guaranteed by the definition of Σ.
We now demonstrate that the resulting tableau is a Young tableau, meaning it increases from left to right and from top to bottom. Firstly, each row is increasing from left to right due to our construction. Suppose that there exists a column where adjacent boxes in rows j and are filled with integers k and , respectively, and . When placing , the box directly above it must still be empty. This implies , contradicting the non-increasing property of ramification sequences. Therefore, the constructed tableau is indeed a Young tableau.
Conversely, a Young tableau can be used to construct the original sequence in a similar manner. Thus, limit linear series on the curve with ramification sequences at and at least and correspond bijectively to the Young tableaux of the Young diagram . □
Example 1.
Consider a curve C of genus 7 and a on C, denoted as L. Let be ramification sequences. In this case, we have
Assume that L is represented as the sequence
Given that and are identical exactly at index : , we place 1 into the first empty box from the left in the -th row. Similarly, since and are identical exactly at index : , we place 2 into the first empty box from the left in the -th row. This process continues until all entries are filled, resulting in the corresponding Young tableau shown below (Figure 5):
Figure 5.
Young tableaux of L.
Conversely, starting from such a Young tableau, we can reconstruct the original sequence of Schubert cycles in the same manner.
3.2. Combinatorial Representation of Certain Monodromy Actions
Next, we investigate the monodromy group action induced by the one-parameter family on the limit linear series of the curve with imposed ramification conditions. To proceed, we need the following lemma:
Lemma 2
([3], Theorem 1.3). Let be two vanishing sequences, such that there exist such that
- (1)
- if ,
- (2)
- (3)
- (4)
- (5)
- .
Then, on , all vanishing sequences at 0 are at least a, at ∞ are at least b, and at 1 and another point are cusps, and the moduli space of linear series is an irreducible rational curve G. The map from each linear series to the corresponding point p gives a map which is a double cover, branching at two points on , and these two branching points are determined by . Conversely, any branching point also determines the value of .
We denote the subgroup of the monodromy group generated by the one-parameter families as the EH group. Using Lemmas 1 and 2, we can determine how the EH group acts on the Young tableaux.
The distance between two boxes in a Young diagram is defined as the sum of their horizontal and vertical distances. Specifically, the distance between adjacent boxes is 1. Following Edidin’s arguments in [5] Proposition 1, we establish that:
Proposition 2.
The EH group is generated by elements . The action exchanges the entries t with in all Young tableaux of shape σ, where t and are in different rows and columns and have a distance of a.
Proof.
Let and be limit linear series on and correspond to sequences
We translate the conditions on vanishing sequences on the limit on the curve in Lemma 1 into conditions on the ramification sequences and . There exist such that the following hold:
- (1)
- if ,
- (2)
- (3)
- (4)
- (5)
Therefore, some family exchanges with only if there exist and such that for any , we have , and
This is because correspond to vanishing sequences , which satisfy the conditions in Lemma 2. Thus, there exists a monodromy action exchanging the restriction of and on the union of and in , leaving the other parts of the limit linear series unchanged, thereby exchanging the limit linear series with on . Let . From Lemma 2, we know that the branching points are determined by a, indicating that the number of all possible branching points is finite. Hence, there exists a monodromy action that exchanges the limit linear series with . This action, denoted by , is the product of all such transpositions and is determined only by t and a.
Let S and T be the Young tableaux representation of and , respectively. According to Theorem 6, each step in the chain of Schubert cycles for the limit linear series involves keeping one of the Schubert indices unchanged and incrementing the rest by 1, while maintaining the monotonicity of the indices. Since and are exactly the same except for , the only difference between and is the order in which the fixed indices are chosen in the steps:
and
Therefore, when represented using Young tableaux, the difference between S and T is that t and are exchanged.
Since S and T are both Young tableaux, they satisfy the monotonicity of rows and columns, meaning t and cannot be in the same row or column in either S or T. Moreover, according to the construction of the Young tableau, the horizontal distance between t and in S is exactly , and the vertical distance between t and in S is exactly . Given that
we conclude that the distance between t and in the Young tableaux S and T is exactly a.
Therefore, the monodromy action on the Young tableaux representation of the limit linear series is to exchange t with in all Young tableaux where t and are located in different rows and columns and have a distance of a. □
Example 2.
Let L be the limit linear series in Example 1. The Young tableau representation T of L is shown on the left in Figure 6.
- (1)
- The action exchanges 3 with 4 whenever 3 and 4 are at a distance of 2. Thus, transforms the tableau T of L into the tableau shown on the right below.
- (2)
- The action of leaves T unchanged since 3 and 4 are not at a distance of 3 in T.
- (3)
- For any , the action of will fix T because 4 and 5 are in the same row in T.
Figure 6.
The action of .
4. Doubly Transitivity of the Monodromy Action
Let be the collection of all Young tableaux of shape ; then, we have
Proposition 3.
The action of the EH group on is transitive.
Proof.
Assign a lexicographic order to the set : column-wise from left to right and top to bottom within each column. In other words, the smallest Young tableau S is the one where are sequentially filled into each column from left to right, and within each column from top to bottom. We only need to prove that any Young tableau can be moved to S by an EH group element. In fact, we only need to prove that for any Young tableau , there exists an EH group element that moves it to a Young tableau that is smaller than T in the lexicographic order. Since this process will eventually stop after a finite number of steps, the final tableau must be S.
Given a Young tableau , let M be the first integer different from S in the lexicographic order. Then must not be to the left or above M in T, because the left and upper sides of M in T are the same as those in S and M is the first integer different from S. Additionally, according to the definition of Young tableaux, the integers below and to the right of M are larger than M, so M and are in different rows and columns. Let a be their distance, then the monodromy action in the EH group moves T to , which is smaller than T in the lexicographic order. □
Theorem 8.
Let be two ramification sequences and suppose that
Then, there exists a family of twice-marked smooth projective curves such that the corresponding is irreducible.
Actually, it can be seen from the proof that this theorem is true for any sufficiently small irreducible family of twice-marked smooth curves, whose stable limits contain all curves of the form in Figure 7.
Figure 7.
Reducible curve.
Proof.
Let be an irreducible family of twice-marked smooth curves and its stable limit contains all stable curves of the form in Figure 7. Then the stable curve obtained by letting approach will add another rational curve . Repeatedly performing this operation will eventually result in the curves and . Therefore, the stable limit of this family include all and .
Shrink B if necessary so that the family is smooth. To prove that is irreducible, it suffices to show that the monodromy action on the fiber is transitive.
According to [4], the family can be extended to its stable limit (at least along one-parameter families). Harris [13] proved that the monodromy group is birational invariant, so it is enough to show that the action on the fiber of is transitive. Now by Proposition 3, the group action induced by the one-parameter families on the fiber of has already been transitive, so we are done. □
More generally, under certain conditions, we can prove that the action of the EH group on is doubly transitive.
Definition 4.
Let G be a group acting on a set S. The action of G on S is doubly transitive if for any with and , there exists a group element such that and .
Lemma 3.
If the given ramification sequences satisfy the following conditions:
- (1)
- ;
- (2)
- ;
- (3)
- For any , ;
- (4)
- For any , .
Then, the action of the EH group on is doubly transitive.
Proof.
Similar to the proof of Proposition 3, we assign a lexicographic order to the set : column-wise from left to right and top to bottom in each column. Let S be the smallest tableau in this order. Let Z be the Young tableau obtained by filling the boxes row-wise from top to bottom and from left to right in each row. By using induction on the size of the Young diagram, we can see that Z is the largest tableau in the lexicographic order.
To establish the doubly transitivity of the EH group action, it is sufficient to prove that any Young tableau can be transformed into S by an EH group element while preserving the Young tableau Z. Actually, it is enough to prove that for any Young tableau , there exists an EH group element that moves T to a tableau smaller in the lexicographic order, with fixing the tableau Z. Since this process is finite, it will eventually stop, with the final tableau being S, while the tableau Z remains unchanged.
Given a Young tableau , let be the first integer in the lexicographic order that differs from S. Let represent the integer in the box located at the i-th (starting from 1) row from top to bottom and the j-th (starting from 1) column from left to right in tableau T. The integer M cannot appear to the left of or above the box containing , because at these positions, T and S are identical, and is the first different integer. Therefore, M can only lie above and to the right of . Let , . We denote their distance as
We aim to exchange M with in T, while keeping Z fixed, so that T becomes a Young tableau with a smaller lexicographic order. If M and are in the same row in Z, then the group action is sufficient to achieve this. Therefore, we only need to consider the case where M and are not in the same row. Let us assume M is at the end of the i-th row and is at the beginning of the -th row in Z. If the distance between M and in Z is not equal to L, i.e.,
then the group action can exchange M with in T while fixing Z. Therefore, in the following proof, we always assume
Now we consider the position of and let . Then the possible positions of are as follows:
- (1)
- ;
- (2)
- ;
- (3)
- ;
- (4)
- ;
- (5)
- .
This is illustrated in Figure 8.
Figure 8.
Possible positions of .
Case 1: If , we can use the group action to exchange M with . Since is in the same row as M in Z, fixes Z. Then, we apply the group action to exchange M with in T. Given that
the action fixes Z. Thus, the composition of these two group actions exchange M with in T while keeping Z unchanged.
Case 2: If , the proof follows a similar approach to that in Case 1. First we use the group action to exchange M with while maintaining Z. Subsequently, we apply the group action to exchange M with in T. Since
the action fixes Z. Therefore, the composition of these two group actions achieves the goal.
Case 3: If , meaning and are in the same column, then must be directly above . If not, M would also have to be positioned between and , contradicting our assumption. In this case, M must be positioned in one of the upper-left corners of the columns to the right of the column containing . This is because the smallest integer in these columns is M. Additionally, according to Assumption (1), we have
which is a contradiction. Therefore, this case cannot occur.
If , indicating that is in one of the columns to the left of , then M must be in the first box of the column it belongs to. As in the previous case, M must be in one of the upper-left corners of the columns to the right of the one containing . Thus, by using a similar argument, we arrive at a contradiction in this case as well.
Case 4: If , i.e., is above M, then it must be adjacent to M; otherwise, there would be no integer between and M to fill in. In this case, we can first exchange M with in T using . Note that this exchange also affects M and in Z. Next, we exchange and M in using . Since and M in are separated by a distance of , they remain unchanged in . Finally, we exchange M with in using , resulting in
while and M in are in the same column and thus remain unchanged. Therefore, fixes Z and reduces to in T, hence
This process does not require the conditions.
Case 5: If is in the same row as M, then must be adjacent to M. Note that we have already addressed Case 3, so we assume . In this case, we consider the position of . If is also in the same row and adjacent to , we continue this process with , and so on, until we find such that M are consecutive in the same row, but is not. Let . Since , it must be that .
Subcase 5.1: If , meaning that is in the same column as , then must be adjacent to , as the integers are not in this column. Therefore, , which means and M are in adjacent rows. Additionally, since is the first integer in the Young tableau T that differs from S, there are no integers lying above . Hence, the condition (1) implies that M must be in the first row. According to Condition (3)
in the second row, there must be exactly boxes to the left of boxes. Condition (2) implies that
hence M can only be at the end of the first row in Z. This means that the first row of T is , namely, the first row of T is exactly the same as the first row of Z.
We proceed by using induction on the number of rows to prove that, when the first row of T is the same as that of Z, T can be moved to a lexicographically smaller tableau through an EH group action. If , then the Young diagram has only two rows. The first row of T is identical to that of Z, so there is only one way to fill the second row, which implies T is the same as Z. However, this contradicts the assumption that . Therefore, this case cannot occur when .
If , by the induction hypothesis, for Young diagrams with s rows satisfying the conditions, the action of the EH group on all of its Young tableaux is doubly transitive. Let be the sub-Young diagram of obtained by removing the first row. Similarly, let and be the Young tableaux obtained by removing the first row from T and Z, respectively. Then the has s rows and , are Young tableaux of satisfying the conditions.
We can identify actions on the set of Young tableaux of with actions on the tableaux of that have the same first row as Z, since actions do not change the integers in the first row. If is not the lexicographically smallest Young tableau of diagram , then by the induction hypothesis, there exists an EH group action such that in the lexicographic order and consequently, . If is the lexicographically smallest Young tableau of , then since , must be in the same column as and directly below . Now, we first exchange M with in T using , which simultaneously changes Z. Next, we apply to exchange and in . Since the distance between and in is , no changes occur in . Finally, we exchange M with in using , resulting in
Because and M in are in the same column, they remain unchanged. Thus, fixes Z and reduces to M in T, hence
Therefore, the claim is proved according to the induction hypothesis. Also note that this induction depends on proving other cases of the lemma, but other cases do not need induction, thus avoiding circular reasoning.
Subcase 5.2: If , that is and are in different columns, then we consider the position of .
Subcase 5.2.1: If , then , hence there is no integer above M. If M is not in the first row, then by Assumption (1),
which is a contradiction. Therefore, is the first row of T. This means that the first row of T is exactly the same as the first row of Z. We have already addressed such a case in Case 5.1, so we are done.
Subcase 5.2.2: If , Let . Similarly, the possible positions for are as follows:
- (1)
- (2)
- (3)
- (4)
- .
We can sequentially exchange adjacent pairs of to move to the original position of in T. This reduces to Cases 1, 2, or 3, which have been proved earlier. Thus, through a composition of several group actions, we can exchange M with in the tableau T to obtain a Young tableau with a smaller lexicographic order. However, we need to check that Z remains unchanged after these actions.
If , i.e., M is at the end of the first row in Z, then since , the numbers , are also in the first row in Z. Hence, the actions leave Z unchanged. If , the length of the i-th row is at least as long as the row containing M in T. Consequently, , all lie in the same row of Z, keeping Z unchanged. Since M and are in different rows, it follows that . Therefore, we have completed the proof of Case 5.
Combining all the cases above, we are done. □
Example 3.
- (1)
- If , then the Young diagram consists of 2 rows. In this case, all the conditions in Lemma 3 become vacuous. Therefore, for any ramification sequences , the EH group is doubly transitive.
- (2)
- If , which corresponds to the unramified case, then the conditions of Lemma 3 simplify to , so this lemma serves as a generalization of Edidin’s theorem from [5].
- (3)
- This lemma also leads to several interesting cases. For instance, if , which are known as cusps, then the conditions of Lemma 3 simplify to , so the EH group acts doubly transitively in this case (Figure 9).
Figure 9. Example (3). - (4)
- If , , then the conditions of Lemma 3 simplify to the following:
- (1)
- ;
- (2)
- .
For instance, when and , the EH group acts doubly transitively. (Figure 10)
Figure 10. Example (4).
Remark 1.
Section 3 of [5] addressed the unramified case, but the proof has some gaps: case (4a) in [5] does not consider when is the smallest element, and case (3) does not consider when is above M. Here, we provide a complete proof and simplify the arguments for case (5) in [5].
Using the doubly transitivity of the EH group action, we can establish that the EH group is actually a very large subgroup. Under certain conditions, it is either the alternating group or the full symmetric group. To begin, let us revisit a classical theorem in group theory.
Theorem 9
(Bochert). Let G be a doubly transitive subgroup of the symmetric group . If there exists an element in G such that the number of elements moved by g is fewer than , then G is either the symmetric group or the alternating group .
This theorem tells us that we need to find a nontrivial element that moves only a sufficiently small number of elements.
Lemma 4.
If and , then there is an element of the EH group that moves at most one-quarter of the Young tableaux.
Proof.
Let s be the length of the first column of and be the length of the first row. Additionally, let be the distance from the lower-left corner to the upper-right corner of the Young diagram .
If the ramification sequence satisfies
we consider the EH group element . Let A be the set of all Young tableaux moved by , i.e., those not fixed by . Let T be a Young tableau in A. Since L is the farthest distance between two boxes in and
L can only be the distance between the lower-left corner and the upper-right corner of . Thus, the integers in the lower-left box or the upper-right box must be . Since the total number of boxes in the first column and row is and the integers filled in the boxes except the lower-left and upper-right boxes must be less than , the numbers filled in the first row and column are exactly . Now, consider and . Since is the smallest integer after removing the first row and first column, we have . Similarly, is the second smallest integer after removing the first row and first column, so either or .
We construct three Young tableaux from T. The tableau is obtained by exchanging with , by exchanging with , and by first exchanging with , and then with . Due to the special positions of and , the resulting tableaux are still Young tableaux. Since each of has at least one of and not in the lower-left corner or the upper-right corner, they will all be fixed by .
For any with , we can similarly construct the corresponding three tableaux . Next, we show that and are distinct Young tableaux. By construction, is different from and . Moreover, since the lower-left corner and the upper-right corner of are , and those of are and , respectively, is different from . The tableaux and are obtained by the actions and on T and S, respectively. If , then the distances between and in and are different, so . If , then . Since , we have
Therefore, is different from . Similarly, by symmetry, is distinct from and is distinct from as well. and are obtained from and , respectively, by exchanging with . If the positions of and are different, then . If the positions of in and are the same, then the positions of and would be completely identical, contradicting the distinctness of and . Hence, and must be distinct. Therefore, are mutually distinct Young tableaux.
By constructing for each T in A, we obtain a new set of Young tableaux. Similarly, sets can be obtained. As argued earlier, the sets have equal cardinality and are pairwise disjoint. Therefore, the number of Young tableaux moved by is at most one-quarter of the total number of Young tableaux.
If the ramification sequence does not satisfy
we then consider the EH group element . The proof follows a similar approach to the previous case. Let A be the set of all Young tableaux moved by . For any , the lower-left corner and the upper-right corner of T are and . We denote the Young diagram obtained from removing the first row and first column of as . If has only one upper-left corner, it must be in the first row of . Given that the smallest integer in is , the upper-left corner of must be , and must be adjacent to either to the right or below. Since the upper-left corner is in the first row of , cannot be in the same row as or .
For T, we construct as follows: is obtained from T by exchanging with , by exchanging with , and by first exchanging with and then with . The resulting tableaux are still Young tableaux. By arguments analogous to those used previously, and are pairwise distinct Young tableaux. Therefore, similarly, we can conclude that the number of Young tableaux moved by is at most one-quarter of all Young tableaux.
If has more than one upper-left corner, we choose any two of them, denoted as and . For any , we construct corresponding tableaux as follows: is obtained from exchanging with , by exchanging with , and by exchanging with . Since both and are upper-left corners, the resulting tableaux remain Young tableaux after these exchanges. Moreover, the tableaux are fixed by the EH group element . Finally, using similar reasoning, we conclude that the number of Young tableaux moved by is at most one-quarter of all Young tableaux. □
Theorem 10.
Given two ramification sequences . Suppose
and , . Let denote the number of Young tableaux of the Young diagram . If satisfy the conditions of Lemma 3, then the EH group is either the alternating group or the symmetric group .
Proof.
If the ramification sequences satisfy the conditions of Lemma 3, then the action of the EH group on the set of all Young tableaux is doubly transitive. Next, we demonstrate that the EH group also satisfies the condition of Bochert’s theorem.
The Young diagram contains a maximal rectangle-shaped sub-Young diagram of size . Its left and right sides are also sub-skew Young diagrams, which we denote by and , respectively. Since , has at least three rows. Furthermore,
ensuring that the size of the rectangle-shaped Young diagram is at least . Let m be the number of boxes in and n be the number of boxes in . We can fill lexicographically into and into . By filling into the middle rectangle such that forms a Young tableau, this filling yields a Young tableau of the entire Young diagram . Conversely, if are filled in such a way that forms a Young tableau, then becomes a Young tableau as well. Hence, the number of Young tableaux of the (skew) Young diagram is at least the number of Young tableaux of the shape . On the other hand, by considering placing a subrectangle at the upper-left of , we have
For Young diagrams, the hook-length formula calculates the number of all Young tableaux. Specifically, for a rectangle-shaped diagram of size , according to the hook-length formula, the number of all Young tableaux is
Thus, we have
This implies
Therefore, to apply Bochert’s theorem, we only need to identify a nontrivial element in the EH group that moves at most one-quarter of the Young tableaux. Lemma 4 constructs such an element, establishing that the EH group is at least the alternating group. Since the EH group is a subgroup of the monodromy group, it follows that the monodromy group is also at least the alternating group; hence, we are done. □
5. Monodromy Groups of Families of Linear Series with Imposed Ramifications
In this section, we utilize the lemmas proved earlier to establish the main results.
Theorem 11.
Given two ramification sequences . Suppose
and , . Let denote the number of Young tableaux of the Young diagram . If α, β satisfy the conditions of Lemma 3, then the monodromy group of in Theorem 8 is either the alternating group or the symmetric group .
Proof.
By the proof of Theorem 8, the monodromy group of is the same as the monodromy group of the fiber of the stable limit , and the EH group induced by the one-parameter families is a subgroup of the monodromy group. Since satisfy the conditions of Theorem 10, the EH group is either the alternating group or the symmetric group. Consequently, the monodromy group is either the alternating group or the symmetric group . □
For , we can determine the EH group in some cases.
Proposition 4.
Assume . If , , and for some integer , then the monodromy group of in Theorem 8 is the symmetric group.
Proof.
The given and satisfy the conditions of Lemma 3; hence, by Theorem 11, the monodromy group is at least the alternating group. To show that it is indeed the full symmetric group, it suffices to find an odd permutation in it. Let . We prove that the EH group action exchanging with is odd when for some integer i. We consider the number n of pairs of Young tableaux exchanged by this action. Given that the set of integers in the first row and the first column is determined, there are choices for the first row and column. After removing the first row and the first column, the resulting diagram is a rectangle. The number of Young tableaux of this diagram is the Catalan number . A result about the oddity of Catalan numbers (see [14]) states that is odd if and only if for some integer i. Therefore, when for some i, the number is odd. This implies that is an odd permutation, so that the monodromy group is the full symmetric group. □
When , we can prove a stronger result: the monodromy group is indeed the full symmetric group for any and .
Lemma 5.
If , then the EH group is the full symmetric group.
Proof.
Let be the Young diagram associated to the ramification sequences . We consider the EH group element or constructed in the proof of Lemma 4, where s is the length of the first column of , t is the length of the first row of , and L denotes the distance from the lower-left corner to the upper-right corner of .
If the first row and the first column share common boxes, we take . Let T be a Young tableau of and be moved by ; then, the integer in the lower-left corner of T is either or and must be 1. Hence, integers in the boxes except for the last one in the first row and the first column are uniquely determined. Since , has only two rows. Therefore, integers greater than can only be arranged sequentially in the remaining boxes of the second row. Thus, the integers in the boxes in T, except for the lower-left corner and the upper-right corner, are uniquely determined. Therefore, the action of on all Young tableaux is just a transposition, moving only T and .
If the first row and the first column do not share common boxes, we take . Let T be a Young tableau of moved by . Similarly, except for the lower-left corner and the upper-right corner, the integers in the boxes of T are uniquely determined. Hence, the action of on all Young tableaux is also a transposition.
Given that satisfy the conditions of Lemma 3, according to Lemmas 3, we know that the EH group is doubly transitive. Let be a transposition where . For any pair of distinct Young tableaux , the doubly transitivity of the EH group ensures there exists an EH group element g such that
Consider the group element . Then,
For any , we have
showing that is the transposition . Therefore, the EH group includes all transpositions. It follows that the EH group is the full symmetric group. □
Thus, we obtain
Proposition 5.
Given two ramification sequences . Suppose
and let . If , then the monodromy group of the family of linear series in Theorem 8 is the symmetric group .
Proof.
Similar to the proof of Theorem 11, the monodromy group of the family of linear series contains the EH group. Given that the EH group is the full symmetric group, it follows that the monodromy group is . □
Funding
This research received no external funding.
Data Availability Statement
The original contributions presented in the study are included in the article; further inquiries can be directed to the corresponding author.
Acknowledgments
I would like to thank Xiang He for suggesting this problem and helpful conversations.
Conflicts of Interest
The author declare no conflict of interest.
References
- Griffiths, P.; Harris, J. On the variety of special linear systems on a general algebraic curve. Duke Math. J. 1980, 47, 233–272. [Google Scholar] [CrossRef]
- Gieseker, D. Stable curves and special divisors: Petri’s conjecture. Invent. Math. 1982, 66, 251–275. [Google Scholar] [CrossRef]
- Eisenbud, D.; Harris, J. Irreducibility and monodromy of some families of linear series. Ann. Sci. l’École Norm. SupéRieure 1987, 20, 65–87. [Google Scholar] [CrossRef]
- Eisenbud, D.; Harris, J. Limit linear series: Basic theory. Invent. Math. 1986, 85, 337–371. [Google Scholar] [CrossRef]
- Edidin, D. The monodromy of certain families of linear series is at least the alternating group. Proc. Am. Math. Soc. 1991, 113, 911–922. [Google Scholar] [CrossRef]
- Chan, M.; Martín, A.L.; Pflueger, N.; Bigas, M.T.I. Genera of Brill-Noether curves and staircase paths in Young tableaux. Trans. Am. Math. Soc. 2018, 370, 3405–3439. [Google Scholar] [CrossRef]
- Teixidor-i Bigas, M. Brill-Noether loci with ramification at two points. Ann. Mat. Pura Appl. 2023, 202, 1217–1232. [Google Scholar] [CrossRef]
- Pflueger, N. Versality of Brill-Noether flags and degeneracy loci of twice-marked curves. arXiv 2021, arXiv:2103.10969. [Google Scholar]
- Osserman, B. A limit linear series moduli scheme. Ann. l’Institut Fourier 2006, 56, 1165–1205. [Google Scholar] [CrossRef]
- Osserman, B. Limit linear series for curves not of compact type. J. Reine Angew. Math. 2019, 2019, 57–88. [Google Scholar] [CrossRef]
- Eisenbud, D.; Harris, J. Divisors on general curves and cuspidal rational curves. Invent. Math. 1983, 74, 371–418. [Google Scholar] [CrossRef]
- Bercov, R.D.; Proctor, R.A. Solution of a combinatorially formulated monodromy problem of Eisenbud and Harris. Ann. Sci. l’École Norm. Supérieure 1987, 20, 241–250. [Google Scholar] [CrossRef]
- Harris, J. Galois groups of enumerative problems. Duke Math. J. 1979, 46. [Google Scholar] [CrossRef]
- Alter, R.; Kubota, K.K. Prime and prime power divisibility of Catalan numbers. J. Comb. Theory Ser. A 1973, 15, 243–256. [Google Scholar] [CrossRef][Green Version]
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content. |
© 2025 by the author. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (https://creativecommons.org/licenses/by/4.0/).