Papers
Topics
Authors
Recent
Search
2000 character limit reached

Poset pinball, the dimension pair algorithm, and type A regular nilpotent Hessenberg varieties

Published 18 Dec 2010 in math.AG, math.AT, and math.CO | (1012.4054v2)

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 algorithm) which yields the result of a successful outcome of Betti poset pinball for any type AA regular nilpotent Hessenberg and any type AA nilpotent Springer variety, considered as GKM-compatible subspaces of the flag variety $\Flags(\C<sup>n)$. The definition of the algorithm is motivated by a correspondence between Hessenberg affine cells and certain Schubert polynomials which we learned from Erik Insko. Second, in the special case of the type AA regular nilpotent Hessenberg varieties specified by the Hessenberg function h(1)=h(2)=3h(1)=h(2)=3 and h(i)=i+1h(i) = i+1 for 3≤i≤n−13 \leq i \leq n-1 and h(n)=nh(n)=n, we prove that the pinball result coming from the dimension pair algorithm is poset-upper-triangular; by results of Harada and Tymoczko this implies the corresponding equivariant cohomology classes form a $H<sup>*_{S<sup>1}(\pt)$-module basis for the S<sup>1S<sup>1-equivariant cohomology ring of the Hessenberg variety.

Authors (2)
Citations (1)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.