A Path Algorithm for Affine Kazhdan-Lusztig Polynomials

We develop an algorithm for computing affine Kazhdan-Lusztig polynomials, for all Lie types. This generalizes our previously published algorithm for type A, which in turn is a faster version of an algorithm due to Lascouz, Leclerc and Thibon (proposed in the setting of Hecke algebras of type A, at r...

Full description

Saved in:
Bibliographic Details
Main Authors Goodman, Frederick M, Wenzl, Hans
Format Journal Article
LanguageEnglish
Published 28.11.2000
Subjects
Online AccessGet full text
DOI10.48550/arxiv.math/0011245

Cover

Abstract We develop an algorithm for computing affine Kazhdan-Lusztig polynomials, for all Lie types. This generalizes our previously published algorithm for type A, which in turn is a faster version of an algorithm due to Lascouz, Leclerc and Thibon (proposed in the setting of Hecke algebras of type A, at roots of unity.)
AbstractList We develop an algorithm for computing affine Kazhdan-Lusztig polynomials, for all Lie types. This generalizes our previously published algorithm for type A, which in turn is a faster version of an algorithm due to Lascouz, Leclerc and Thibon (proposed in the setting of Hecke algebras of type A, at roots of unity.)
Author Wenzl, Hans
Goodman, Frederick M
Author_xml – sequence: 1
  givenname: Frederick M
  surname: Goodman
  fullname: Goodman, Frederick M
– sequence: 2
  givenname: Hans
  surname: Wenzl
  fullname: Wenzl, Hans
BackLink https://doi.org/10.48550/arXiv.math/0011245$$DView paper in arXiv
BookMark eNrjYmDJy89LZWCQNjTQM7EwNTXQTyyqyCzTy00sydA3MDA0NDIx5WQwd1QIAAooOOak5xdllmTkKqTlFyk4pqVl5qUqeCdWZaQk5un6lBZXlWSmKwTk51Tm5edmJuYU8zCwpgGpVF4ozc2g6OYa4uyhC7YkvqAoMzexqDIeZFk81DJjYtQAAJTlOHE
ContentType Journal Article
DBID AKZ
GOX
DOI 10.48550/arxiv.math/0011245
DatabaseName arXiv Mathematics
arXiv.org
DatabaseTitleList
Database_xml – sequence: 1
  dbid: GOX
  name: arXiv.org
  url: http://arxiv.org/find
  sourceTypes: Open Access Repository
DeliveryMethod fulltext_linktorsrc
ExternalDocumentID math_0011245
GroupedDBID AKZ
GOX
ID FETCH-arxiv_primary_math_00112453
IEDL.DBID GOX
IngestDate Wed Jul 23 01:59:29 EDT 2025
IsDoiOpenAccess true
IsOpenAccess true
IsPeerReviewed false
IsScholarly false
Language English
LinkModel DirectLink
MergedId FETCHMERGED-arxiv_primary_math_00112453
OpenAccessLink https://arxiv.org/abs/math/0011245
ParticipantIDs arxiv_primary_math_0011245
PublicationCentury 2000
PublicationDate 2000-11-28
PublicationDateYYYYMMDD 2000-11-28
PublicationDate_xml – month: 11
  year: 2000
  text: 2000-11-28
  day: 28
PublicationDecade 2000
PublicationYear 2000
Score 2.5763643
SecondaryResourceType preprint
Snippet We develop an algorithm for computing affine Kazhdan-Lusztig polynomials, for all Lie types. This generalizes our previously published algorithm for type A,...
SourceID arxiv
SourceType Open Access Repository
SubjectTerms Mathematics - Combinatorics
Mathematics - Quantum Algebra
Mathematics - Representation Theory
Title A Path Algorithm for Affine Kazhdan-Lusztig Polynomials
URI https://arxiv.org/abs/math/0011245
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
link http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwfZzPT8IwFMdfgJMXIxGjKKYarw1dfwx2XIiEqBEOmuy2tN3GSBAMDCP89b51M-Gi17avfWmbvs9L-n0AD9ZXVgtrqDDSUozHghqkZqoD5ttEJpwZ90H21Z-8y6dIRQ24_9XC6M334quqD2y2fYS2vF9SC5eqCU1EhVLOO42q8kGuGFdtcTwSOdM1HgWK8Rmc1oRHwupI2tBIV-cwCMkMbUm4nK8xHc8_CMIiCbMMIY8860Oe6BV92W0PxWJOZuvlvlQL483owN348W00oW6p-LOqDRGXfsS1H-ICWpjDp5dAjPKE0pwJLX2ph54WQcYMw4eS21QOgivo_j1P97_Oazhx6nDPo3x4A61is0t7GCcLc-u26gdZcW6Q
linkProvider Cornell University
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=A+Path+Algorithm+for+Affine+Kazhdan-Lusztig+Polynomials&rft.au=Goodman%2C+Frederick+M&rft.au=Wenzl%2C+Hans&rft.date=2000-11-28&rft_id=info:doi/10.48550%2Farxiv.math%2F0011245&rft.externalDocID=math_0011245