Lower bounds for Kazhdan-Lusztig polynomials from patterns

By Sara C. Billey, Tom Braden. 2002

63 citations recorded by the source corpus.

Kazhdan-Lusztig polynomials Px,w(q) play an important role in the study of Schubert varieties as well as the representation theory of semisimple Lie algebras. We give a lower bound for the values Px,w(1) in terms of "patterns". A pattern for an element of a Weyl group is its image under a combinatorially defined map to a subgroup generated by reflections. This generalizes the classical definition of patterns in symmetric groups. This map corresponds geometrically to restriction to the fixed point set of an action of a one-dimensional torus on the flag variety of a semisimple group G. Our lower bound comes from applying a decomposition theorem for "hyperbolic localization" [Br] to this torus action. This gives a geometric explanation for the appearance of pattern avoidance in the study of singularities of Schubert varieties.

Subfields: Discrete Mathematics and Combinatorics, Geometry and Topology, Mathematical Physics

View Paper: https://www.semanticscholar.org/paper/890dd7060c21d278c97e10e294c0390138d0f579

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Discrete Mathematics and Combinatorics

  1. Alexander Yong
  2. Alexander Woo
  3. Frank Sottile
  4. Shawn Robinson
  5. Cristian Lenart
  6. Anders Skovsted Buch
  7. Hugh Thomas
  8. Matthew J. Samuel

In Geometry and Topology

  1. Alexander Yong
  2. Alexander Woo
  3. Frank Sottile
  4. Shawn Robinson
  5. Cristian Lenart
  6. Marcelo Aguiar
  7. Li Guo
  8. Kurusch Ebrahimi-Fard

In Mathematical Physics

  1. Alexander Yong
  2. Frank Sottile
  3. Shawn Robinson
  4. Cristian Lenart
  5. Alexander Woo
  6. Anders Skovsted Buch
  7. Hugh Thomas
  8. Matthew J. Samuel

Citations in the corpus