WorksMathematics
Presentations of the cohomology ring of Hessenberg varieties for the minimal nilpotent orbit in type A
Abstract
In 2016 Abe and Crooks found a presentation for the cohomology ring of Hessenberg varieties associated with the minimal nilpotent orbit. Specifically, they presented the ring as a quotient of the cohomology ring of the flag variety, and described the kernel of the quotient map as the span of certain Schubert classes. This note improves upon their result in the Lie type A case, by giving a minimal generating set for the kernel. Our description uses substantially fewer generators than that of Abe-Crooks. Our list consists of a set of Schubert polynomials associated to permutations constructed from the Hessenberg function .
Introduction
Let be a positive integer and let denote the flag variety of nested sequences of subspaces such that for all . Such a sequence of subspaces is called a full flag. Let be a weakly increasing function such that for all , called a Hessenberg function. The subvariety
is the (type A) Hessenberg variety in associated to a choice of Hessenberg function and a matrix . The study of Hessenberg varieties lies at the intersection of algebraic geometry, representation theory, combinatorics, and theory of quasisymmetric functions, among many other research areas (cf. [15 Part III] and references therein). In this manuscript we focus exclusively on Lie type A, i.e., the flag variety corresponding to .
The study of the cohomology rings of Hessenberg varieties has been an active research area for some time. We view this theory as part of a rich history of the study of the cohomology rings of subvarieties of (partial and full) flag varieties (as a non-exhaustive list, see e.g. [12, 18, 19, 20]). We also note that a recent preprint [4] studies a situation very similar to ours, namely, the cohomology rings of certain unions of Schubert varieties. One of the challenges of this research area within Hessenberg geometry is to find explicit descriptions of these cohomology rings via generators and relations, in a manner similar to the well-known case of with its famous Borel presentation. When is nilpotent, the case for all is a well-studied special case where the corresponding Hessenberg varieties are called Springer fibers. The cohomology rings of Springer fibers were studied several decades ago (e.g. De Concini–Procesi [9], Garsia–Procesi [11]) and have an explicit description via the Tanisaki ideal (e.g. [11, 21]). However, outside of the Springer case, less is known, although some cases are understood (e.g. [2, 3]).
Abe and Crooks study Hessenberg varieties associated with the minimal nilpotent orbit in [1]. Specifically, they give a description of the cohomology ring of the associated Hessenberg variety as a quotient of the cohomology ring of the flag variety, where the kernel of the quotient map is additively generated by an explicit list of Schubert classes [1 Theorem 32]. In the present manuscript, we improve upon their result by finding a substantially smaller set of Schubert classes which minimally generate this kernel (Theorem B).
It should be acknowledged that there has been other work in Hessenberg geometry which has built on, or generalized, results in Abe and Crooks’ work which is not discussed in this manuscript. Examples include Goldin and Precup’s flat degenerations from minimal semisimple to minimal nilpotent Hessenberg schemes [13], Escobar, Precup, and Shareshian’s results on singular loci, irreducibility, reducedness, and Poincaré polynomials of codimension one Hessenberg varieties in type A [10], and Goldin and Tymoczko’s work on the GKM properties enjoyed by certain Hessenberg varieties [14].
We work with coefficients for our cohomology rings. We also assume throughout the paper that is a positive integer, . Here and below, we fix once and for all our choice , where is the matrix with a in position and a elsewhere. In type A, this is a minimal nilpotent element, and the results of [1] apply. With this established, we recall the following.
Definition 1.1. Let and let be a Hessenberg function. We say that is -forbidden if . We let denote the set of -forbidden permutations.
The above terminology is motivated by a geometric result in the work of Abe and Crooks: they show in [1 Proposition 3] that is -forbidden precisely when its associated coordinate flag does not lie in . They then show that the cohomology ring is isomorphic to where and denotes the Schubert class corresponding to .
The main results of this note give a substantially smaller generating set for the denominator of the above description of . In fact, we give two separate results, as we now explain. Recall that the cohomology of the flag variety has a Borel description as as in [7], where is the th elementary symmetric polynomial in . In fact, this description is also valid with coefficients. For , let denote the associated Schubert polynomial [16] in the variables . It is well-known that the Schubert cohomology class of the opposite Schubert variety associated to can be represented by in the above Borel presentation; we use this (opposite) convention for Schubert classes throughout (cf. [15 Part I, Chapter 1] and [1]). In analogy to the ideal above, we now define . Our two main results, Theorem A and Theorem B, give efficient sets of generators of and respectively.
We take a moment to discuss the motivation for presenting our results in the form given below. It would have been possible to present Theorem B as our one main result. We chose instead to present two separate theorems because it makes it clearer that the simplification of the set of generators, which was the original motivation for our investigations, can be understood in two stages. The simplification that is recorded in Theorem A(2) occurs at the level of the polynomial ring, arising from a relationship among Schubert polynomials. It is when we quotient by the ideal generated by positive degree symmetric polynomials (to obtain the cohomology of the flag variety) that we obtain the next simplification, recorded in Theorem B, which allows us to also delete some of the Schubert classes from the list of generators.
We now define the set of permutations that give our efficient generating sets. For the definition below, we represent permutations by their one-line notation, so for we write and refer to as the entry in position .
Definition 1.2. Let be a Hessenberg function. For each with , let be the permutation with in position , in position , and all remaining entries arranged in increasing order. In one-line notation, we have
where empty intervals are assumed to be omitted.
Our first result gives a monic Gröbner basis for in .
Theorem A. Let , be a Hessenberg function. Then:
for each , , we have
where denotes the complete homogeneous symmetric polynomial of degree , in the variables , with ,
as ideals in we have
for the lexicographic order , the polynomials form a monic Gröbner basis for .
We note that the generating set in Theorem A need not be minimal (see Remark 3.7). The above theorem shows that the set is sufficient to generate . The analogous result for the ideal in requires even fewer generators, indexed by a set defined below. We have the following.
Theorem B. Let , let be a Hessenberg function, and set
Restriction induces an isomorphism of graded -algebras
Moreover, every ideal-generating set of this kernel has at least elements, and thus our classes form a minimal generating set.
We call the elements of the corners of ; they are the last indices of the maximal intervals on which is constant and less than . It is also worth comparing our description of in Theorem B with that of Abe and Crooks. There are many additive generators for in the Abe-Crooks description. Our description of the same ideal has generators, and these form a minimal set. Thus, a cardinality that is factorial in has been replaced by one that is linear in .
Our paper is structured as follows. Section 2 reviews the necessary background on flag varieties and Hessenberg varieties. We also discuss Schubert polynomials and their connections to divided difference operators. Our main results are proved in Sections 3 and 4.
Background
We use the flag variety and the Hessenberg varieties defined in § 1, and fix once and for all the matrix
with a single 1 entry in the upper-right corner and 0’s elsewhere. This matrix is in the weight space of the (unique) highest root of and belongs to a minimal nilpotent orbit of . As noted in [1 Lemma 1], Hessenberg varieties associated to different matrices in the same orbit are isomorphic, so to study the topology of Hessenberg varieties associated to the minimal nilpotent orbit, it suffices to study . Thus, in this manuscript we fix and allow to vary. It is known that, in this case, the Hessenberg variety is a union of Schubert varieties.
We now recall the results of Abe and Crooks [1] regarding the cohomology rings of . These results form the starting point of our investigation. A permutation determines a permutation matrix in and hence an associated permutation flag, see e.g. [15 Section 1.3.3]. Let be the maximal torus of diagonal invertible matrices. Then acts on , and the -fixed points are precisely the permutation flags corresponding to elements [15 Exercise 5.63]. By a slight abuse of notation we will also denote by the permutation flag, so we write . With this notation we have
and Abe and Crooks prove the following for :
Proposition 2.1 ([1 Proposition 3]). Let as above and a Hessenberg function. Then the set of -fixed points of is
Comparing (2) with Definition 1.1, we see that the -forbidden permutations are precisely the permutations that are not -fixed points of , that is,
We emphasize that this description depends on the choice of .
Next recall that has an affine paving given by Schubert cells. Let and denote the Borel subgroups of upper-triangular and lower-triangular matrices in , respectively. The (opposite) Schubert varieties are defined as . Then determines an opposite Schubert class . (See [15 Chapter 1] for background.)
The following is a combination of [1 Corollary 31] and [1 Theorem 32].
Theorem 2.2. Let as above and a Hessenberg function. Let denote the Hessenberg variety associated to and . Then the linear subspace
is an ideal in , and moreover,
As mentioned in the introduction, our main technique is to use divided difference operators and Schubert polynomials. We briefly recall the basic definitions and properties we need, following [17 Chapters II and IV]. Let denote the simple transposition in which interchanges and and acts as the identity on other elements.
Definition 2.3. For , let act on by interchanging and . The divided difference operator on is defined by
Note that the divided difference operator satisfies the Leibniz rule
for all .
The Schubert polynomial of a permutation is defined recursively using divided difference operations. Specifically, if is the long word permutation, set
and if is a simple transposition such that , then
The Lehmer code of is , where . That is, counts the number of entries to the right of the -th position in that are smaller than . We say is dominant if is weakly decreasing. We will make use of the following fact.
Proposition 2.4. ([17 Equation (4.7)]) Let . Suppose that is a dominant permutation. Then .
Proof of Theorem A
In this section we prove Theorem A. The arguments in this section hold over , so we work with the polynomial ring . Here we sketch the outline of our argument. First, we compute the Schubert polynomials explicitly (Lemma 3.3). Proposition 3.6 is the main technical argument of this section, where we show that the generate . To do so, we define an auxiliary ideal, determined by the positions of and , and show that it is preserved by the divided difference operators. This is the key step needed for a descending induction argument on Bruhat length. Coupled with the weakly-ascending property of Hessenberg functions, we can express any forbidden Schubert polynomial in terms of those associated to the permutations , giving the claim. An examination of their leading terms gives the Gröbner basis statement (Proposition 3.9).
The lemma below records facts concerning the which follow directly from Definition 1.2.
Lemma 3.1. Let be a Hessenberg function and let satisfy . Then
,
, and
.
Example 3.2 (Running example). Let and , and write throughout this running example. Since exactly for , there are five permutations . By Definition 1.2, is the forbidden permutation with in position , in position , and the remaining entries in increasing order. Explicitly, they are
For , we set the notation
and recall from Theorem A that denotes the complete homogeneous symmetric polynomial of degree in . We use three elementary facts. First, for , so by Definition 2.3, multiplication by commutes with :
Second, for and , we have [17 (3.9)]
Third, applying (8) repeatedly to gives
We compute the Schubert polynomials of the permutations .
Lemma 3.3. Let with . Then
Proof. Set and consider the permutation
The number of inversions starting in the first position is , the number starting in each of positions is , and all remaining inversion counts are zero. These counts form the Lehmer code of and are weakly decreasing, so is dominant. By Proposition 2.4, we have
From the definition of we see that . Each successive right multiplication moves one position to the right and decreases the length by 1. Thus repeated application of (6) gives
Since , each of commutes with multiplication by by (7), so
where the final equality follows from (9).
Example 3.4 (Example 3.2, continued). Lemma 3.3 gives with . The table below records the corresponding data for this example.
| 1 | 2 | 3 | 4 | 5 | |
| 621345 | 263145 | 236145 | 234651 | 234561 | |
| 1 |
Table 3.4.
The factor is fixed by the position of 1, and by the position of 6. Because and , the pairs and share their -factor and differ only in . The two pairs however behave differently. Since , we have
so is redundant already in . In contrast, is not a multiple of . We will revisit this example in Example 4.7.
Our main result seeks to relate the Schubert polynomials for to those of the form . To do this, we introduce an auxiliary ideal that depends only on the positions of and 1. By symmetry and (8), the polynomials satisfy
For , define
Lemma 3.5. Let , and suppose that and satisfy . Then
Proof. We first claim that
Indeed, let , , and . By (7) and (4) we have
Since , (10) shows that is either or with . Hence , from which (12) follows.
We now use descending induction on to prove (11). The base case is the longest word . In this case we have , and
We can then see that the Schubert polynomial is a multiple of by (5), so the claim holds in this case. Now suppose has length and suppose by induction that the claim holds for all permutations with length greater than . Choose an ascent of , so , and define . Since and by hypothesis, this ascent cannot occur at or . Moreover, if and , then and . Consequently, and
Since , the relation (6) together with the induction hypothesis and (12) now give
This is what we needed to show. □
We now apply Lemma 3.5 to prove the generation statement.
Proposition 3.6. Let , be a Hessenberg function. Then, as ideals in , we have
Proof. From Lemma 3.1(3) we know that for each with , so one inclusion is immediate. Thus it suffices to show that if , then .
Suppose , and put and . The forbidden condition and the definition of a Hessenberg function give
By Lemma 3.5, we have . Therefore, in order to show the claim, it would suffice to show that every generator of lies in the RHS of (13). To see this, let with . The weakly ascending condition of implies . In particular, , and Lemma 3.3 gives
where an empty product is understood to be . Thus every generator of belongs to the RHS of (13), and hence so does , as required. □
Remark 3.7. The generating set in Theorem A need not be minimal. If and , then is a multiple of .
Example 3.8 (Example 3.4, continued). We trace the proof of Theorem A(2) for . First note that is in position and in position , which means , so is -forbidden. Lemma 3.5 says that lies in , and indeed
Since and , the above formula yields . A similar argument applies to each of the forbidden permutations. Thus, in this example, we have replaced the generators with generators.
Our Theorem A also makes a claim about Gröbner bases. Our next result addresses this.
Proposition 3.9. Let and be a Hessenberg function. Consider the lexicographic order on . Then the polynomials , for with , form a monic Gröbner basis of , with leading monomials
Proof. For the given lexicographic order, it is immediate from the definition of that its leading term is , which has coefficient . Multiplying by the monomial then yields that the leading monomial of is , which also has coefficient . In particular, each is monic, and it remains to check the -polynomials.
Let with , and assume . For simplicity of notation, set and . We now compute the -polynomial . From the assumption we have , which means
From the formula for we also know that the monomial divides both and . In particular, if denote the remaining terms of so that
then we also have and . Let
denote the lcm of . Since and are monic, the -polynomial is
Both coefficients in the last expression belong to .
Every monomial in is strictly smaller in the given lexicographic order than , and likewise for . Thus, omitting any zero summands,
Hence every -polynomial has a representation in the generators in which each summand has leading monomial strictly smaller than the corresponding least common multiple. This is an LCM representation in the sense of [8 Chapter 2, § 9, Definition 5]. A refinement of Buchberger’s criterion in terms of LCM representations [8 Chapter 2, § 9, Theorem 6] implies that the form a Gröbner basis over . To obtain the integral statement, take . Division by the monic polynomials uses only integer coefficients. Its remainder is also a remainder for the same division over , where it is zero by the Gröbner-basis property. Thus the form a monic Gröbner basis over . □
Remark 3.10. The exponent vectors of the leading monomials in Proposition 3.9 are the Lehmer codes of the permutations , as defined before Proposition 2.4. Indeed,
which is precisely the exponent vector of . These leading terms can also be interpreted as the monomials associated to the bottom pipe dreams of the tuple , where crosses in row occupy the first columns; see [5].
Remark 3.11. We noted in Remark 3.7 that if , then the generators corresponding to with are multiples of and hence are not needed. These are the only divisibilities among the leading monomials of the appearing in Proposition 3.9, so by discarding the generators corresponding to these we still obtain a minimal Gröbner basis.
Proof of Theorem A. Part (1) of the theorem is in Lemma 3.3, part (2) is Proposition 3.6, and Proposition 3.9 establishes the Gröbner basis claim in (3). This completes the proof. □
Proof of Theorem B
In this section, we prove Theorem B. We first sketch our argument. The ring is a quotient of the polynomial ring by the ideal . Our key observation is that if is such that , then the Schubert class is a multiple of (cf. Proposition 4.6). This allows us to reduce to the corner generators.
Next, we identify the for as the Bruhat-minimal elements of the forbidden set . The Bruhat support of Schubert multiplication shows that these classes remain linearly independent modulo positive-degree multiples of the kernel, establishing the minimality and cardinality claims. We use coefficients, following [1].
For a partially ordered set , we say that a subset of is a down-set if, whenever and , then . Similarly we say that is an up-set if, whenever and , then . Note that the complement of a down-set is an up-set, and vice versa.
Lemma 4.1. Let and be a Hessenberg function. Let and let be the Hessenberg variety corresponding to and . Then is a down-set with respect to the Bruhat order, and is an up-set with respect to the Bruhat order.
We will use the tableau criterion [6 Theorem 2.6.3] for the Bruhat order on . This is defined by creating a tableau for a permutation such that in row , we place the first elements of in ascending order. If , then with respect to the Bruhat order if and only if every entry of the tableau of is less than or equal to the corresponding entry in the tableau of . For example, if and , then the tableaux are
Then in Bruhat order since each entry in the tableau of is less than or equal to the corresponding entry in the tableau of .
Proof. Suppose . Suppose also that and . From the tableau criterion for Bruhat order, if , then and . Since and is weakly increasing, we conclude that
which means that , as desired. The second claim follows immediately. □
Recall from § 1 that the set of corners is . We begin with a characterization of when a permutation lies above in Bruhat order, in terms of its one-line notation.
Lemma 4.2. In the setting of Lemma 4.1, let and suppose , and let denote the permutation of Definition 1.2. Let . Then:
Proof. First suppose that . By Lemma 3.1 we know that appears in the -th position and appears in the -th position of the one-line notation of . By the tableau criterion for Bruhat order, it follows that must appear in one of the first positions of , i.e., , and similarly that must appear in the -th position or further to its right, i.e., .
For the reverse direction, suppose now that and . By the tableau criterion, it suffices to show that for each , the -th smallest of the first entries of is at most the -th smallest of the first entries of , for every . By Definition 1.2, the first entries of form the set
If , then is not among the first entries of , so the -th smallest of them is at least . If , then is among the first entries of , so the largest of them is . Together with the fact that the -th smallest of any distinct positive integers is at least , these two observations give the required inequalities in each of the three cases, so . □
Lemma 4.3. In the setting of Lemma 4.1, the Bruhat-minimal elements of are precisely the where is a corner of .
Proof. Suppose . Let be the position of in the one-line notation of . Since is in , this means . Lemma 4.2 then implies . Thus every element of lies above some member of the family , and this family is contained in by Lemma 3.1(3). Hence the Bruhat-minimal elements of are exactly the minimal elements of this family. Next suppose that and and . By Lemma 4.2 we have
By the definition of Hessenberg functions, if , then so in fact we have
Thus, two indices and with distinct values of have corresponding and which are incomparable in Bruhat order, and for a collection of (consecutive) indices with the same value of , it is the largest value of the index which yields the Bruhat-smallest . The largest such indices are precisely the corners . This proves the lemma. □
Example 4.4 (Example 3.2, continued). By Equation (14), if and only if and . The only such pairs with are and . For the first pair, the tableaux
differ only in the fourth row. For example, because , and because . All other pairs are incomparable. Hence the Bruhat-minimal elements of are , indexed by the corners , in accordance with Lemma 4.3. ◇
We saw in the above lemma that if then . There is a corresponding statement about the associated Schubert polynomials. Recall that denote the elementary symmetric polynomials in the variables . Before proceeding, it is useful to recall the following relation between complete homogeneous symmetric polynomials and the elementary symmetric polynomials. This is standard but we include it here for the convenience of the reader. Let denote the generating function for the complete homogeneous symmetric functions on a set of variables , and similarly for the elementary symmetric functions . (So for example if for some , then and .)
Lemma 4.5. Let . Let be integers such that and . Then lies in the ideal .
Proof. The argument uses well-known identities in symmetric functions; we sketch the argument. By the definitions above, we have the identity on generating functions . From this we immediately obtain . Now compare the coefficient of on both sides to obtain
Rearranging to isolate the term corresponding to on the LHS, multiplying by , and using (where we use , and we interpret the notation as equal to if ), gives
Every term on the right-hand side lies in the ideal , so the conclusion holds. □
We can now prove the last remaining step for the proof of Theorem B, which is related to non-corners of .
Proposition 4.6. In the setting of Lemma 4.1, suppose is such that . Then
Proof. We begin by noting that the assumption implies that and hence , so . Moreover, since by assumption on Hessenberg functions, we know . Next observe that, for any positive degree , we have the relation . Using this with , we have
To conclude the argument it suffices to see that is contained in the ideal . Since as noted above, this follows from Lemma 4.5. This concludes the proof. □
Example 4.7 (Example 3.4, continued). For the running example, Proposition 4.6 applies to and , since and thus and . For , we follow the argument in the proof and observe , which gives . The first term lies in by Lemma 4.5 applied to the choice . Indeed, writing , we get
which visibly lies in the ideal . Hence .
For we have and we also know and . Observe also that . Putting these together yields
The above computation follows the argument made in the proof of Proposition 4.6. However, as already observed in Remark 3.7, in the case of we can view the relation in a different way. Since and , we can simply observe that is a multiple of , and hence is a redundant generator.
The remaining generators are indexed by the corners , and are exactly the Bruhat-minimal forbidden permutations (Lemma 4.3). Theorem B therefore gives
and no generating set of this kernel has fewer than three elements, compared with the 288 classes of the Abe–Crooks additive basis. ◇
We now show that the classes indexed by the Bruhat-minimal forbidden permutations generate , thus proving the second main result of this paper.
Proof of Theorem B. We begin by recalling what we know in the context of the polynomial ring , building on the fact that . First note that the proof of Theorem A also holds verbatim with coefficients in place of coefficients. With this said, from here onwards we interpret all statements to be in . By Theorem A(2), the ideal is generated by the polynomials with . Since is represented by and, by Theorem 2.2, is the ideal generated by , it follows that is generated by the classes with . Moreover, Proposition 4.6 gives
where by slight abuse of notation, also denotes its image in . By the definition of the set given in (1) it follows that
We next prove that every ideal-generating set has at least elements. First recall that the Schubert classes form a -additive basis for and that form a -additive basis for . Let denote the ideal of positive-degree elements in . The subspace is spanned by products of the form for and . By iterating the variable-multiplication formula [17 (4.15′)], and using commutativity, we know for and if , then . In particular, any appearing on the RHS must have , and since this implies and hence the inequality is strict, i.e., . Since is an additive basis of by Theorem 2.2 we know , and by Lemma 4.3 and the fact that we conclude that cannot be a minimal Bruhat element. It follows that, for any element of , the basis expansion of in terms of the basis has a 0 coefficient in front of all the Bruhat-minimal elements . This in turn implies that the image of is linearly independent in the -vector space . On the other hand, they must also span this vector space, since we just saw above that they generate . It follows that
Observe that for any set that generates the ideal , the image of in must -span this quotient, since . Hence every such must have at least many elements. The set has precisely elements and hence it is minimal, i.e., there is no proper subset which generates .
Finally, the asserted presentation of the cohomology ring follows from Theorem 2.2. □
Acknowledgments
We thank Peter Crooks for helpful conversations, interest in this work, and ongoing encouragement. We additionally thank Colleen Robichaux, Anna Weigandt, and Oliver Pechenik for sharing their expertise on Schubert polynomials and pipe dreams in the early stages of our investigations. The set of generators as discussed in this manuscript was first found experimentally through computations with SAGE, as part of Nardone’s NSERC USRA project in Summer 2026 while working under the supervision of Harada. GG was funded by SNF Postdoc.Mobility grant P500PT_225436. MH was supported by a Canada Research Chair Award (Tier 1) and NSERC Discovery Grant 2019-06567. JR was supported by NSERC Discovery Grant 2023-04800. AVT was supported by NSERC Discovery Grant 2024-05299.
Declaration of AI Use
The authors made use of Claude Opus 5.5 and GPT Astra 6 as part of their investigation of the minimal generators. The authors reviewed all AI output and wrote the paper; they take full responsibility for the content of this paper.
(G. Gaggero) Department of Mathematics and Statistics McMaster University, Hamilton, ON L8S 4L8, Canada
Email address: [email protected]
(M. Harada) Department of Mathematics and Statistics McMaster University, Hamilton, ON L8S 4L8, Canada
Email address: [email protected]
(H. Nardone) Department of Mathematics, McGill University, Montreal, QC H3A 0B9, Canada
Email address: [email protected]
(B. Nasserden) Department of Mathematics and Statistics McMaster University, Hamilton, ON L8S 4L8, Canada
Email address: [email protected]
(J. Rajchgot) Department of Mathematics and Statistics McMaster University, Hamilton, ON L8S 4L8, Canada
Email address: [email protected]
(L. Seccia) Department of Mathematics and Statistics McMaster University, Hamilton, ON L8S 4L8, Canada
Email address: [email protected]
(A. Van Tuyl) Department of Mathematics and Statistics McMaster University, Hamilton, ON L8S 4L8, Canada
Email address: [email protected]
References
- [1]Hiraku Abe and Peter Crooks, Hessenberg varieties for the minimal nilpotent orbit, Pure Appl. Math. Q. 12 (2016), no. 2, 183–223. MR 3767215arxiv.org/abs/1510.02436
- [2]Hiraku Abe, Megumi Harada, Tatsuya Horiguchi, and Mikiya Masuda, The cohomology rings of regular nilpotent Hessenberg varieties in Lie type A, Int. Math. Res. Not. IMRN (2019), no. 17, 5316–5388. MR 4001030
- [3]Hiraku Abe, Tatsuya Horiguchi, and Mikiya Masuda, The cohomology rings of regular semisimple Hessenberg varieties for h = (h(1), n, . . . , n), J. Comb. 10 (2019), no. 1, 27–59. MR 3890915
- [4]Ashleigh Adams-Jessmore, Sean Griffin, and Tim Ryan, Face rings and the cohomology of unions of Schubert varieties, 2026, arXiv:2611.15065.
- [5]Nantel Bergeron and Sara Billey, RC-graphs and Schubert polynomials, Experiment. Math. 2 (1993), no. 4, 257–269. MR 1281474DOI
- [6]Anders Björner and Francesco Brenti, Combinatorics of Coxeter groups, Graduate Texts in Mathematics, vol. 231, Springer, New York, 2005. MR 2133266DOI
- [7]Armand Borel, Sur la cohomologie des espaces fibrés principaux et des espaces homogènes de groupes de Lie compacts, Ann. of Math. (2) 57 (1953), 115–207. MR 51508DOI
- [8]David A. Cox, John Little, and Donal O’Shea, Ideals, varieties, and algorithms: An introduction to computational algebraic geometry and commutative algebra, fourth ed., Undergraduate Texts in Mathematics, Springer, Cham, 2015. MR 3330490
- [9]Corrado De Concini and Claudio Procesi, Symmetric functions, conjugacy classes and the flag variety, Invent. Math. 64 (1981), no. 2, 203–219. MR 629470DOI
- [10]Laura Escobar, Martha Precup, and John Sheshanshian, Hessenberg varieties of codimension one in the flag variety, Canad. Math. Bull. (2026). MR 5066163
- [11]A. M. Garsia and C. Procesi, On certain graded S_n-modules and the q-Kostka polynomials, Adv. Math. 94 (1992), no. 1, 82–138. MR 1168926DOI
- [12]V. Gasharov and V. Reiner, Cohomology of smooth Schubert varieties in partial flag manifolds, J. London Math. Soc. (2) 66 (2002), no. 3, 550–562. MR 1934291DOI
- [13]Rebecca Goldin and Martha Precup, A flat family of matrix Hessenberg schemes over the minimal sheet, J. Algebra 692 (2026), 123–172. MR 5002214
- [14]Rebecca Goldin and Julianna Tymoczko, Which Hessenberg varieties are GKM?, Pure Appl. Math. Q. 19 (2023), no. 4, 1899–1942. MR 4671386arxiv.org/abs/2301.09741
- [15]Erik Ikson, Martha Precup, and Edward Richmond (eds.), Handbook of combinatorial algebraic geometry—subvarieties of the flag variety, Discrete Mathematics and its Applications (Boca Raton), CRC Press, Boca Raton, FL, 2026. MR 5129420
- [16]Alain Lascoux and Marcel-Paul Schützenberger, Polynômes de Schubert, C. R. Acad. Sci. Paris Sér. I Math. 294 (1982), no. 13, 447–450. MR 660739
- [17]I. G. Macdonald, Notes on Schubert polynomials, Publications du LaCIM, vol. 6, Université du Québec à Montréal, Montréal, 1991.
- [18]Aba Mbirika and Julianna Tymoczko, Generalizing Tanisaki’s ideal via ideals of truncated symmetric functions, J. Algebraic Combin. 37 (2013), no. 1, 167–199. MR 3016306
- [19]Victor Reiner, Alexander Woo, and Alexander Yong, Presenting the cohomology of a Schubert variety, Trans. Amer. Math. Soc. 363 (2011), no. 1, 521–543. MR 2719692arxiv.org/abs/0809.2981
- [20]Avery St. Dizier and Alexander Yong, Presenting the cohomology of a Schubert variety: proof of the minimality conjecture, J. Lond. Math. Soc. (2) 109 (2024), no. 1, Paper No. e12832, 22. MR 4680222DOI
- [21]Toshiyuki Tanisaki, Defining ideals of the closures of the conjugacy classes and representations of the Weyl groups, Tohoku Math. J. (2) 34 (1982), no. 4, 575–585. MR 685425DOI