×

Maximal Newton polygons via the quantum Bruhat graph. (English. French summary) Zbl 1440.05196

Proceedings of the 24th international conference on formal power series and algebraic combinatorics, FPSAC 2012, Nagoya, Japan, July 30–August 3, 2012. Nancy: The Association. Discrete Mathematics & Theoretical Computer Science (DMTCS). Discrete Math. Theor. Comput. Sci., Proc., 899-910 (2012).
Summary: This paper discusses a surprising relationship between the quantum cohomology of the variety of complete flags and the partially ordered set of Newton polygons associated to an element in the affine Weyl group. One primary key to establishing this connection is the fact that paths in the quantum Bruhat graph, which is a weighted directed graph with vertices indexed by elements in the finite Weyl group, encode saturated chains in the strong Bruhat order on the affine Weyl group. This correspondence is also fundamental in the work of Lam and Shimozono establishing Peterson’s isomorphism between the quantum cohomology of the finite flag variety and the homology of the affine Grassmannian. In addition, using some geometry associated to the poset of Newton polygons, one obtains independent proofs for several combinatorial statements about paths in the quantum Bruhat graph and its symmetries, which were originally proved by Postnikov using the tilted Bruhat order. An important geometric application of this work is an inequality which provides a necessary condition for non-emptiness of certain affine Deligne-Lusztig varieties in the affine flag variety.
For the entire collection see [Zbl 1257.05001].

MSC:

05E05 Symmetric functions and generalizations
05E16 Combinatorial aspects of groups and algebras
14M15 Grassmannians, Schubert varieties, flag manifolds
14N35 Gromov-Witten invariants, quantum cohomology, Gopakumar-Vafa invariants, Donaldson-Thomas invariants (algebro-geometric aspects)