Related papers: A generalization of immanants based on partition a…
Arc permutations, which were originally introduced in the study of triangulations and characters, have recently been shown to have interesting combinatorial properties. The first part of this paper continues their study by providing signed…
Let $G$ be a complex classical group, and let $V$ be its defining representation (possibly plus a copy of the dual). A foundational problem in classical invariant theory is to write down generators and relations for the ring of…
We investigate the representation of symmetric polynomials as a sum of squares. Since this task is solved using semidefinite programming tools we explore the geometric, algebraic, and computational implications of the presence of discrete…
A fundamental identity in the representation theory of the partition algebra is $n^k = \sum_{\lambda} f^\lambda m_k^\lambda$ for $n \geq 2k$, where $\lambda$ ranges over integer partitions of $n$, $f^\lambda$ is the number of standard Young…
We derive a general recurrence relation for squares of Fibonacci-like numbers. Various properties are developed, including double binomial summation identites.
Partition functions for non-interacting particles are known to be symmetric functions. It is shown that powerful group-theoretical techniques can be used not only to derive these relationships, but also to significantly simplify calculation…
Group algebras of permutations have proved highly useful in solving a number of problems in large N gauge theories. I review the use of permutations in classifying gauge invariants in one-matrix and multi-matrix models and computing their…
This article investigates integer sequences that partition the sequence into blocks of various lengths - irregular arrays. The main result of the article is explicit formulas for numbering of irregular arrays. A generalization of Cantor…
Using the diagrammatic approach to integrals over Gaussian random matrices, we find a representation for polynomial Lie group integrals as infinite sums over certain maps on surfaces. The maps involved satisfy a specific condition: they…
We study a linear map on symmetric functions that ``divides'' a partition by a positive integer $k$, sending a Schur function indexed by a partition of $kn$ to a symmetric function indexed by partitions of $n$. We determine its Schur…
A Pfaffian-type Murnaghan-Nakayama rule is derived for the Hecke-Clifford algebra $\mathcal{H}^c_n$ based on the Frobenius formula and vertex operators, and this leads to a combinatorial version via the tableaux realization of Schur's…
It is well-known that the representation theory of the finite group of unipotent upper-triangular matrices $U_n$ over a finite field is a wild problem. By instead considering approximately irreducible representations (supercharacters), one…
In the 1940s Littlewood formulated three fundamental correspondences for the immanants and Schur symmetric functions on the general linear group, which establish deep connections between representation theory of the symmetric group and the…
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,…
We give a combinatorial interpretation of the determinant of a matrix as a generating function over Brauer diagrams in two different but related ways. The sign of a permutation associated to its number of inversions in the Leibniz formula…
We generalize linear superalgebra to higher gradings and commutation factors, given by arbitrary abelian groups and bicharacters. Our central tool is an extension, to monoidal categories of modules, of the Nekludova-Scheunert faithful…
In this paper, we introduce the notion of super-immanants for supermatrices over a supercommutative algebra. Using the super Schur-Weyl duality we show that the super immanants play a significant role in covariant tensor representations of…
Cumulants are a notion that comes from the classical probability theory, they are an alternative to a notion of moments. We adapt the probabilistic concept of cumulants to the setup of a linear space equipped with two multiplication…
The computational function of a matchgate is represented by its character matrix. In this article, we show that all nonsingular character matrices are closed under matrix inverse operation, so that for every $k$, the nonsingular character…
This is an introduction to the group algebras of the symmetric groups, written for a quarter-long graduate course. After recalling the definition of group algebras (and monoid algebras) in general, as well as basic properties of…