首页 | 本学科首页   官方微博 | 高级检索  
     


Lower bounds for Kazhdan-Lusztig polynomials from patterns
Authors:Sara C.?Billey  mailto:billey@math.mit.edu"   title="  billey@math.mit.edu"   itemprop="  email"   data-track="  click"   data-track-action="  Email author"   data-track-label="  "  >Email author,Tom?Braden  mailto:braden@math.umass.edu"   title="  braden@math.umass.edu"   itemprop="  email"   data-track="  click"   data-track-action="  Email author"   data-track-label="  "  >Email author
Affiliation:(1) Department of Mathematics, Massachusetts Institute of Technology, Cambridge, MA 02139, USA;(2) Department of Mathematics and Statistics, University of Massachusetts, Amherst, MA 01003, USA
Abstract:
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.
Keywords:
本文献已被 SpringerLink 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号