Related papers: Character polynomials for two rows and hook partit…
The reduced Kronecker coefficients are particular instances of Kronecker coefficients that contain enough information to recover them. In this notes we compute the generating function of a family of reduced Kronecker coefficients. We also…
In an earlier paper [1] it was shown that the Frobenius compound characters for the symmetric groups are related to the irreducible characters by a linear relation that involves a unitriagular coupling matrix that gives the Frobenius…
Formulas for the expansion of arbitrary invariant group functions in terms of the characters for the Sp(2N), SO(2N+1), and SO(2N) groups are derived using a combinatorial method. The method is similar to one used by Balantekin to expand…
Consider the polynomial ring in countably infinitely many variables over a field of characteristic zero, together with its natural action of the infinite general linear group G. We study the algebraic and homological properties of finitely…
In this paper we describe how representation theory of groups can be used to shorten the derivation of two loop partition functions in string theory, giving an intrinsic description of modular forms appearing in the results of D'Hoker and…
In [Wyser-Yong '13] we introduced polynomial representatives of cohomology classes of orbit closures in the flag variety, for the symmetric pair $(GL_{p+q}, GL_p \times GL_q)$. We present analogous results for the remaining symmetric pairs…
We provide a direct connection between Springer theory, via Green polynomials, the irreducible representations of the pin cover $\wti W$, a certain double cover of the Weyl group $W$, and an extended Dirac operator for graded Hecke…
Let R be a locally finitely generated algebra over a discrete valuation ring V of mixed characteristic. For any of the homological properties, the Direct Summand Theorem, the Monomial Theorem, the Improved New Intersection Theorem, the…
Properties of higher characters are developed and applied to symmetric products and Frobenius algebras. A `constructive' proof of the Gel'fand-Kolmogorov theorem is given. Generalisations of that theorem and the Nullstellensatz to symmetric…
We study 2-representations, i.e., actions of 2-groups on 2-vector spaces. Our main focus is character theory for 2-representations. To this end we employ the technique of extended Burnside rings. Our main theorem is that the Ganter-Kapranov…
Let $c_n$ denote the number of nodes at a distance $n$ from the root of a rooted tree. A criterion for proving the rationality and computing the rational generating function of the sequence $\{c_n\}$ is described. This criterion is applied…
The ring of symmetric functions $\Lambda$, with natural basis given by the Schur functions, arise in many different areas of mathematics. For example, as the cohomology ring of the grassmanian, and as the representation ring of the…
We establish an explicit formula for the character of an irreducible finite-dimensional representation of $\mathfrak{gl}(m|n)$. The formula is a finite sum with integer coefficients in terms of a basis $\mathcal{E}_{\mu}$ (Euler characters)…
In an isomorphic copy of the ring of symmetric polynomials we study some families of polynomials which are indexed by rational weight vectors. These families include well known symmetric polynomials, such as the elementary, homogeneous, and…
We develop a theory of levels for irreducible representations of symmetric groups of degree $n$ analogous to the theory of levels for finite classical groups. A key property of level is that the level of a character, provided it is not too…
In this work, we establish a relationship between the sum of irreducible character degrees and the number of twisted involutions associated with the automorphisms of a finite group. We develop algorithmic frameworks for evaluating these…
We prove that a Schur function of rectangular shape $(M^n)$ whose variables are specialized to $x_1,x_1^{-1},...,x_n,x_n^{-1}$ factorizes into a product of two odd orthogonal characters of rectangular shape, one of which is evaluated at…
In 2009, the first author proved the Nekrasov-Okounkov formula on hook lengths for integer partitions by using an identity of Macdonald in the framework of type $\widetilde A$ affine root systems, and conjectured that some summations over…
We explore some connections between vectors of integers and integer partitions seen as bi-infinite words. This methodology enables us to give a combinatorial interpretation of the Macdonald identities for affine root systems of the seven…
Each graph and choice of a commutative ring gives rise to an associated graphical group. In this article, we introduce and investigate graph polynomials that enumerate conjugacy classes of graphical groups over finite fields according to…