{'fraction_non_alphanumeric': 0.030685920577617327, 'fraction_numerical': 0.01444043321299639, 'mean_word_length': 5.235955056179775, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
MIT GRADUATE STUDENT LUNCH SEMINAR SPRING 2017

Abstract: Representations of the symmetric group Sn are easy to parametrize but difficult to understand in detail. “W -graphs” were introduced by David Kazhdan and George Lusztig in a 1979 paper. They’re a fairly simple combinatorial structure that describes very explicitly a representation of a Coxeter group (such as the symmetric group). I’ll explain the definition, some of what it’s good for (including infinite-dimensional representation theory of reductive groups) and some recent extensions of it.