Skip to main content
10 events
when toggle format what by license comment
Mar 19, 2013 at 0:19 answer added Greg Warrington timeline score: 11
Mar 18, 2013 at 12:52 answer added Jim Humphreys timeline score: 2
Mar 18, 2013 at 12:18 comment added Harry Huang Thanks @Shunsuke, that's something novel to me. But what I'm looking for is like a list of prime numbers...
Mar 18, 2013 at 2:51 comment added Shunsuke Tsuchioka How about PyCox? (arxiv.org/pdf/1201.5566v2.pdf) For type A, see also arxiv.org/pdf/1010.3961v1.pdf (and the author's C code available at cems.uvm.edu/~gswarrin/research/klpol/klpol.html).
Mar 18, 2013 at 2:06 comment added Harry Huang @Jim: Currently I'm focused on symmetric groups since that is the easiest to work on. Indeed, Goresky specified elements of S_n by their reduced expressions and made the table very un-readable.
Mar 18, 2013 at 1:56 history edited Harry Huang CC BY-SA 3.0
deleted 2 characters in body; edited tags
Mar 17, 2013 at 17:59 comment added Jim Humphreys P.S. Maybe a tag co.combinatorics is more directly relevant here than rt? Of course, applications tend to involve representation theory, but combinatorists (and sometimes algebraic geometers) have also been active in studying the polynomials.
Mar 17, 2013 at 17:56 comment added Jim Humphreys It's important to be specific about which Coxeter groups you are looking at, since the computations can get arbitrarily long and may not be instantly informative. Goresky's tables for Weyl groups and affine Weyl groups of low ranks are certainly useful (and as far as I know accurate). But the need to select a single reduced expression for each group element inevitably causes some trouble. While the newer computer methods of du Cloux, Adams, and others are improved, the main focus is just on finite Weyl groups including the notorious $E_8$.
Mar 17, 2013 at 17:22 answer added paul garrett timeline score: 5
Mar 17, 2013 at 17:09 history asked Harry Huang CC BY-SA 3.0