2012
DOI: 10.5402/2012/254235
|View full text |Cite
|
Sign up to set email alerts
|

Poset Pinball, the Dimension Pair Algorithm, and Type A Regular Nilpotent Hessenberg Varieties

Abstract: In this manuscript we develop the theory of poset pinball, a combinatorial game recently introduced by Harada and Tymoczko for the study of the equivariant cohomology rings of GKM-compatible subspaces of GKM spaces. Harada and Tymoczko also prove that in certain circumstances, a successful outcome of Betti poset pinball yields a module basis for the equivariant cohomology ring of the GKM-compatible subspace. Our main contributions are twofold. First we construct an algorithm (which we call the dimension pair a… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

2
21
0

Year Published

2012
2012
2017
2017

Publication Types

Select...
3
2

Relationship

3
2

Authors

Journals

citations
Cited by 6 publications
(23 citation statements)
references
References 21 publications
(111 reference statements)
2
21
0
Order By: Relevance
“…A similar analysis by Bayegan and the second author in a special case of regular nilpotent Hessenberg varieties [2] yields a poset-uppertriangular basis in the sense of [9]. In contrast to the results in [2], in the present manuscript we find that the module basis is not poset-upper-triangular; this is the first such example in the literature. In addition, a straightforward consequence of our proof is that a simple change of variables yields a module basis which is not a poset pinball basis but is poset-upper-triangular.…”
supporting
confidence: 54%
See 2 more Smart Citations
“…A similar analysis by Bayegan and the second author in a special case of regular nilpotent Hessenberg varieties [2] yields a poset-uppertriangular basis in the sense of [9]. In contrast to the results in [2], in the present manuscript we find that the module basis is not poset-upper-triangular; this is the first such example in the literature. In addition, a straightforward consequence of our proof is that a simple change of variables yields a module basis which is not a poset pinball basis but is poset-upper-triangular.…”
supporting
confidence: 54%
“…Open questions 24 References 24 1 We use English notation for Young diagrams. 2 We work with cohomology with coefficients in C throughout, and hence omit it from our notation.POSET PINBALL, HIGHEST FORMS, AND (n − 2, 2) SPRINGER VARIETIES 3 between permissible fillings and S 1 -fixed points of the Springer variety. The module basis is obtained by taking images under the natural projection map H * T (Fℓags(C n )) → H * S 1 (S (n−2,2) ), to be described in detail below, of a subset of the T -equivariant Schubert classes in H * T (Fℓags(C n )).…”
mentioning
confidence: 99%
See 1 more Smart Citation
“…Using the association of the polynomials f i,j with the (i, j)-th entry of the matrix (3.5), the ideal I h can visually be described as being generated by the f i,j in the boxes at the bottom of each column in the the picture associated to the Hessenberg subspace H(h) defined in (2.2) (see Figure 1). For instance, when h = (3,3,4,5,6,6), the generators are f 3,1 , f 3,2 , f 4,3 , f 5,4 , f 6,5 , f 6,6 .…”
Section: Statement Of Theorem 33 the Equivariant Version Of Theorem Amentioning
confidence: 99%
“…More precisely, we say that a Hessenberg function meets the ℓ-th lower diagonal if there exists some j ∈ [n] such that h(j) − j ≥ ℓ. For example, for h = (2, 3, 4, 5, 5) a Peterson Hessenberg function, the Hessenberg subspace meets the 0-th and 1st lower diagonals, whereas for h = (3,4,4,5,5), the Hessenberg subspace also meets the 2nd lower diagonal. The lowest lower diagonal which h meets is evidently max j∈[n] {h(j) − j}.…”
Section: Properties Of the F Ijmentioning
confidence: 99%