{"paper":{"title":"Computing individual Kazhdan-Lusztig basis elements","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.RT","authors_text":"Leonard Scott, Timothy Sprowl","submitted_at":"2013-09-27T15:08:32Z","abstract_excerpt":"In well-known work, Kazhdan and Lusztig (1979) defined a new set of Hecke algebra basis elements (actually two such sets) associated to elements in any Coxeter group. Often these basis elements are computed by a standard recursive algorithm which, for Coxeter group elements of long length, generally involves computing most basis elements corresponding to Coxeter group elements of smaller length. Thus, many calculations simply compute all basis elements associated to a given length or less, even if the interest is in a specific Kazhdan-Lusztig basis element. Similar remarks apply to \"parabolic\""},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.7265","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"}