In the classic "Concrete Math", by Graham, Patashnik and Knuth, it is stated that "The numbers in Pascal's triangle satisfy, practically speaking, infinitely many identities, so it is not too surprising that we can find some surprising relationships by looking closely." The aim of this note is to indicate that a similar statement seems to hold for the character tables of the symmetric groups $S_n$. Just as important, it is a case-study in using a computer algebra system to prove deep identities, way beyond the ability of mere humans. This article is accomanied by a Maple pacgage, Sn, and ample output, avaialble from the webpage http://www.math.rutgers.edu/~zeilberg/mamarim/mamarimhtml/sn.html .
We give a bijective proof of an identity relating primed shifted gl(n)-standard tableaux to the product of a gl(n) character in the form of a Schur function and a product of sums of x and y terms. This result generalises a number of well--known results due to Robbins and Rumsey, Chapman, Tokuyama, Okada and Macdonald. An analogous result is then obtained in the case of primed shifted sp(2n)-standard tableaux which are bijectively related to the product of a t-deformed sp(2n) character and another x and y product. All results are also interpreted in terms of alternating sign matrix identities, …
A definition is offered of the factorial characters of the general linear group, the symplectic group and the orthogonal group in an odd dimensional space. It is shown that these characters satisfy certain flagged Jacobi-Trudi identities. These identities are then used to give combinatorial expressions for the factorial characters: first in terms of a lattice path model and then in terms of the well known tableaux associated with the classical groups. Factorial Q-functions are then defined in terms of three sets of primed shifted tableaux, and shown to satisfy Tokuyama type identities in each …
Ferrers graphs and tables of partitions are treated as vectors. Matrix operations are used for simple proofs of identities concerning partitions. Interpreting partitions as vectors gives a possibility to generalize partitions on negative numbers. Partitions are then tabulated into lattices and some properties of these lattices are studied. There appears a new identity counting Ferrers graphs packed consecutively into isoscele form. The lattices form the base for tabulating combinatorial identities.
We derive several identities that feature irreducible characters of the general linear, the symplectic, the orthogonal, and the special orthogonal groups. All the identities feature characters that are indexed by shapes that are "nearly" rectangular, by which we mean that the shapes are rectangles except for one row or column that might be shorter than the others. As applications we prove new results in plane partitions and tableaux enumeration, including new refinements of the Bender-Knuth and MacMahon (ex-)conjectures.
We extend the table of Garoufalidis, Le and Zagier concerning conjectural Rogers-Ramanujan type identities for tails of colored Jones polynomials to all alternating knots up to 10 crossings. We then prove these new identities using q-series techniques.
We give a new Jacobi--Trudi-type formula for characters of finite-dimensional irreducible representations in type $C_n$ using characters of the fundamental representations and non-intersecting lattice paths. We give equivalent determinant formulas for the decomposition multiplicities for tensor powers of the spin representation in type $B_n$ and the exterior representation in type $C_n$. This gives a combinatorial proof of an identity of Katz and equates such a multiplicity with the dimension of an irreducible representation in type $C_n$. By taking certain specializations, we obtain identitie…
In this paper, we study the characters of homogeneous monotonic P-polynomial table algebras with finite dimension d>=5. We then apply them to association schemes. To this end, we develop some methods using tridiagonal matrices and Z-transform. Moreover, we calculate the eigenvalues of a special tridiagonal matrix which is found through the first intersection matrix of P-polynomial table algebras.
Leading towards the classification of primitive commutative association schemes as the ultimate goal, Bannai and some of his school have been trying to * identify the major sources of (primitive) commutative association schemes, * collect known group-case primitive commutative association schemes, and * compute their character tables over the last twenty years. The construction of their character tables are important first step for a systematic study of such association schemes and towards the classification of those schemes. In this talk, we briefly survey the progress made in this direction …
In this paper we construct a GL-equivariant complex of Schur modules over a ring of positive characteristic that can be used to deduce classical alternating sum identities for Schur polynomials. This complex globalizes to a complex of vector bundles and can also be used to give an explicit construction of an exact sequence predicted by work of Grayson involving Adams operations identities on the algebraic K-theory of a given scheme $X$. The more general complex gives an explicit construction that reproves the aforementioned Adams operations identities in full generality.
A refinement of the q-trinomial coefficients is introduced, which has a very powerful iterative property. This ``T-invariance'' is applied to derive new Virasoro character identities related to the exceptional simply-laced Lie algebras E_6,E_7 and E_8.
In this paper, we first show that the irreducible characters of a quotient table algebra modulo a normal closed subset can be viewed as the irreducible characters of the table algebra itself. Furthermore, we define the character products for table algebras and give a condition in which the products of two characters are characters. Thereafter, as a main result we state and prove the Burnside-Brauer Theorem on finite groups for table algebras.
I demonstrate how certain identities for Macdonald's polynomials established by Garsia, Haiman and Tesler, together with the conjecture of Hausel, Letellier and Villegas imply explicit relations between mixed Hodge polynomials of different character varieties.
The Murnaghan-Nakayama rule is the classical formula for computing the character table of S_n. Y. Roichman has recently discovered a rule for the Kazhdan-Lusztig characters of q-Hecke algebras of type A, which can also be used for the character table of S_n. For each of the two rules, we give an algorithm for computing entries in the character table of S_n. We then analyze the computational complexity of the two algorithms, and in the case of characters indexed by partitions in the (k,l)-hook, compare their complexities to each other. It turns out that the algorithm based on the Murnaghan-Naka…
For an arbitrary prime $p$ we prove that the proportion of entries divisible by $p$ in certain columns of the character table of the symmetric group $S_n$ tends to 1 as $n\to\infty$. This is done by finding lower bounds on the number of $k$-cores, for $k$ large enough with respect to $n$.
We determine invariants like the Smith normal form and the determinant for certain integral matrices which arise from the character tables of the symmetric groups S_n and their double covers. In particular, we give a simple computation, based on the theory of Hall-Littlewood symmetric functions, of the determinant of the regular character table of S_n with respect to an integer r>1. This result had earlier been proved by Olsson in a longer and more indirect manner. As a consequence, we obtain a new proof of the Mathas' Conjecture on the determinant of the Cartan matrix of the Iwahori-Hecke alg…
If $λ$ and $μ$ are two non-empty Young diagrams with the same number of squares, and $\boldsymbolλ$ and $\boldsymbolμ$ are obtained by dividing each square into $d^2$ congruent squares, then the corresponding character value $χ_{\boldsymbolλ}(\boldsymbolμ)$ is divisible by $d!$.
We provide identities of inverse Chevalley type for the graded characters of level-zero Demazure submodules of extremal weight modules over a quantum affine algebra of type $C$. These identities express the product $e^μ \, \mathrm{gch} \, V_{x}^{-}(λ)$ of the (one-dimensional) character $e^μ$, where $μ$ is a (not necessarily dominant) minuscule weight, with the graded character $\mathrm{gch} \, V_{x}^{-}(λ)$ of the level-zero Demazure submodule $V_{x}^{-}(λ)$ over the quantum affine algebra $U_{\mathsf{q}}(\mathfrak{g}_{\mathrm{af}})$ as an explicit finite linear combination of the graded char…
The Sato-Tate distributions for genus 2 curves (conjecturally) describe the statistics of numbers of rational points on the curves. In this paper, we explicitly compute the auto-correlation functions of Sato-Tate distributions for genus 2 curves as sums of irreducible characters of symplectic groups. Our computations bring about families of identities involving irreducible characters of symplectic groups $Sp(2m)$ for all $m \in \mathbb Z_{\ge 1}$, which have interest in their own rights.
In this investigation of character tables of finite groups we study basic sets and associated representation theoretic data for complementary sets of conjugacy classes. For the symmetric groups we find unexpected properties of characters on restricted sets of conjugacy classes, like beautiful combinatorial determinant formulae for submatrices of the character table and Cartan matrices with respect to basic sets; we observe that similar phenomena occur for the transition matrices between power sum symmetric functions to bounded partitions and the $k$-Schur functions introduced by Lapointe and M…
We show that almost every entry in the character table of $S_n$ is even as $n\to\infty$. This resolves a conjecture of Miller. We similarly prove that almost every entry in the character table of $S_n$ is zero modulo $3,5,7,11,$ and $13$ as $n\to\infty$, partially addressing another conjecture of Miller.
