The Hecke algebra attached to a Coxeter system is a deformation of the group algebra of defined as follows. Take the free -module with basis , and impose the multiplicative relations if , and otherwise. (For now, ignore the square root of .) Humphreys proves that these relations describe a unique associative algebra structure on [...]
Posts Tagged ‘finite fields’
Hecke algebras and the Kazhdan-Lusztig polynomials
Posted in algebraic combinatorics, representation theory, tagged Coxeter groups, duality, finite fields, Hecke algebras, Kazhdan-Lusztig, q-analogues on July 12, 2010 | 2 Comments »
The arithmetic plane
Posted in algebraic number theory, arithmetic geometry, tagged finite fields, Frobenius map, Galois theory on January 4, 2010 | 1 Comment »
If you haven’t seen them already, you might want to read John Baez’s week205 and Lieven le Bruyn’s series of posts on the subject of spectra. I especially recommend that you take a look at the picture of to which Lieven le Bruyn links before reading this post. John Baez’s introduction to week205 would probably [...]
The cyclotomic identity and Lyndon words
Posted in algebraic combinatorics, number theory, tagged finite fields, Frobenius map, Lyndon words, MaBloWriMo, zeta functions on November 3, 2009 | 5 Comments »
In number theory there is a certain philosophy that is a good toy model for the integers . The two rings share an important property: they are basically the canonical examples of Euclidean domains, hence PIDs, hence UFDs. However, many number-theoretic questions involving prime factorization over are much easier than their corresponding questions over . [...]
Young diagrams, q-analogues, and one of my favorite proofs
Posted in abstract algebra, algebraic combinatorics, tagged finite fields, Grassmannians, q-analogues, Young tableaux on June 11, 2009 | 7 Comments »
I’ve decided to start blogging a little more about the algebraic combinatorics I’ve learned over the past year. In particular, I’d like to present one of my favorite proofs from Stanley’s Enumerative Combinatorics I. The theory of Young tableaux is a great example of the richness of modern mathematics: although they can be defined in [...]
The magic of the Frobenius map II
Posted in abstract algebra, combinatorics, graph theory, number theory, tagged finite fields, Frobenius map, Galois theory, walks on graphs on June 9, 2009 | 3 Comments »
Once upon a time I discussed some interesting uses of the Frobenius map to solve some Putnam-style problems. Unfortunately, I wrote that post before becoming really interested in combinatorics, so I neglected to develop that particular side of the story, which I’d like to do now. The beginning of this story is the folklore combinatorial [...]