Preprints and publications |
|---|
|
q-Partition Algebra Combinatorics
Joint with T. Halverson. We compute the dimension dn,r(q) = dim(IRqr) of the defining module IRqr for the q-partition algebra. This module comes from r-iterations of Harish-Chandra restriction and induction on GLn(Fq). This dimension is a polynomial in q that specializes as dn,r(1) = nr and dn,r(0) = B(r), the rth Bell number. We compute dn,r(q) in two ways. The first is purely combinatorial. We show that dn,r(q) = ∑λ f λ(q) mrλ, where f λ(q) is the q-hook number and mrλ is the number of r-vacillating tableaux. Using a Schensted bijection, we write this as a sum over integer sequences which, when q-counted by inverse major index, gives dn,r(q). The second way is algebraic. We find a basis of IRqr that is indexed by n-restricted q-set partitions of {1,..., r}, and we show that there are dn,r(q) of these. pdf (2008). Superinduction for pattern groups Joint with E. Marberg. pdf (2007). Restricting supercharacters of the finite group of unipotent uppertriangular matrices Joint with V. Venkateswaran. pdf (2007). It is well-known that the representation theory of the finite group of unipotent upper-triangular matrices Un over a finite field is a wild problem. By instead considering approximately irreducible representations, one obtains a rich combinatorial theory analogous to that of the symmetric group, where we replace partition combinatorics with set-partitions. These two papers explore two different aspects of this connection. The first paper studies superinduction, and then gives an explicit combinatorial algorithm for computing induction in the case Un in a way that is analogous to the Pieri-formula for the symmetric group. The second paper studies a family of subgroups that interpolate between Un-1 and Un, and uses supercharacter theoretic results to compute combinatorial restriction formulas for Un. Together these papers suggest that there should be an invariant theory for Un analogous to the ring of symmetric functions for the symmetric group. Values of characters sums for finite unitary groups Joint with C.R. Vinroot. A known result for the finite general linear group GL(n,Fq) and for the finite unitary group U(n,Fq2) posits that the sum of the irreducible character degrees is equal to the number of symmetric matrices in the group. Fulman and Guralnick extended this result by considering sums of irreducible characters evaluated at an arbitrary conjugacy class of GL(n,Fq). We develop an explicit formula for the value of the permutation character of U(2n,Fq2) over Sp(2n,Fq) evaluated an an arbitrary conjugacy class and use results concerning Gelfand-Graev characters to obtain an analogous formula for U(n,Fq2) in the case where q is an odd prime power. These results are also given as probabilistic statements. pdf. To appear in J. Algebra. Gelfand-Graev characters of the finite unitary groups Joint with C.R. Vinroot. Gelfand-Graev characters and their degenerate counterparts have an important role in the representation theory of finite groups of Lie type. Using a characteristic map to translate the character theory of the finite unitary groups into the language of symmetric functions, we study degenerate Gelfand-Graev characters of the finite unitary group from a combinatorial point of view. In particular, we give the values of Gelfand-Graev characters at arbitrary elements, recover the decomposition multiplicities of degenerate Gelfand-Graev characters in terms of tableau combinatorics, and conclude with some multiplicity consequences. pdf. Supercharacter formulas for pattern groups Joint with P. Diaconis. C. Andre and N. Yan introduced the idea of a supercharacter theory to give a tractable substitute for character theory in wild groups such as the unipotent uppertriangular group Un(Fq). In this theory superclasses are certain unions of conjugacy classes, and supercharacters are a set of characters which are constant on superclasses. This paper gives a character formula for a supercharacter evaluated at a superclass for pattern groups and more generally for algebra groups. .pdf . To appear in the Transactions of the American Mathematical Society. On the characteristic map of finite unitary groups Joint with C.R. Vinroot. This paper describes the analogue of Green's characteristic map for the unitary group, and gives some representation theoretic applications. Advances in Mathematics 210 (2007): 707-732. pdf . A skein-like multiplication algorithm for unipotent Hecke algebras This paper extends the work of the paper below by analyzing the\ multiplication of basis elements in Unipotent Hecke algebras. This work is done in general type, but a section is devoted to working out the combinatorics in the general linear group case. Transactions of the American Mathematical Society 359 (2007): 1685-1724. pdf . Unipotent Hecke algebras of GLn(Fq) This paper examines a family of Hecke algebras that generalize both the Iwahori-Hecke algebra and the Gelfand-Graev Hecke algebra. I give an explicit basis for these algebras, describe a Cartan-like subalgebra and allow the representation theory to inspire a generalization of the RSK correspondence. Journal of Algebra 284 (2005): 559-577. Unipotent Hecke algebras: the structure, representation theory and combinatorics Quadratic Corestriction, C2-embedding problems, and explicit construction Joint with J. Swallow. This paper came out of an REU at Davidson College. We investigate aspects of the inverse Galois problem. Communications in Algebra 30 (2002): 3227-3258. |