The paper contains a survey of train constructions for infinite symmetric groups and related groups. For certain pairs (a group $G$, a subgroup $K$), we construct categories, whose morphisms are two-dimensional surfaces tiled by polygons and colored in a certain way. A product of morphisms is a gluing of combinatorial bordisms. For a unitary representation of $G$ we assign a functor from the category of bordisms to the category of Hilbert spaces and bounded operators. The construction has numerous variations, instead of surfaces there arise also one-dimensional objects of Brauer diagram type, multi-dimensional pseudomanifolds, bipartite graphs
We show that double cosets of the infinite symmetric group with respect to some special subgroups admit natural structures of semigroups. We interpret elements of such semigroups in combinatorial terms (chips, colored graphs, two-dimensional surfaces with polygonal tiling) and describe explicitly the multiplications.
We develop a marking system for an analog of Hasse diagrams of intervals $[u,v]$ with $u\leq v$ in a Hermitian symmetric pair $W/W_J$, and use this to create a closed form algorithm for computing relative R-polynomials. The uniform nature of this algorithm allows us to show combinatorial invariance of relative Kazhdan-Lusztig polynomials in the Hermitian symmetric space setting.
Motivated by Stanley's conjecture on the multiplication of Jack symmetric functions, we prove a couple of identities showing that skew Jack symmetric functions are semi-invariant up to translation and rotation of a $π$ angle of the skew diagram. It follows that, in some special cases, the coefficients of the skew Jack symmetric functions with respect to the basis of the monomial symmetric functions are polynomials with nonnegative integer coefficients.
Building on the work of P.N. Norton, we give combinatorial formulae for two maximal decompositions of the identity into orthogonal idempotents in the $0$-Hecke algebra of the symmetric group, $\mathbb{C}H_0(S_N)$. This construction is compatible with the branching from $S_{N-1}$ to $S_{N}$.
Inspired by the results of [R. Adin, A. Postnikov, Y. Roichman, Combinatorial Gelfand model, preprint math.RT arXiv:0709.3962], we propose combinatorial Gelfand models for semigroup algebras of some finite semigroups, which include the symmetric inverse semigroup, the dual symmetric inverse semigroup, the maximal factorizable subsemigroup in the dual symmetric inverse semigroup, and the factor power of the symmetric group. Furthermore we extend the Gelfand model for the semigroup algebras of the symmetric inverse semigroup to a Gelfand model for the $q$-rook monoid algebra.
We construct Hopf algebras whose elements are representations of combinatorial automorphism groups, by generalising a theorem of Zelevinsky on Hopf algebras of representations of wreath products. As an application we attach symmetric functions to representations of graph automorphism groups, generalising and refining Stanley's chromatic symmetric function.
We present combinatorial operators for the expansion of the Kronecker product of irreducible representations of the symmetric group. These combinatorial operators are defined in the ring of symmetric functions and act on the Schur functions basis. This leads to a combinatorial description of the Kronecker powers of the irreducible representations indexed with the partition (n-1,1) which specializes the concept of oscillating tableaux in Young's lattice previously defined by S. Sundaram. We call our specialization {\it Kronecker tableaux}. Their combinatorial analysis leads to enumerative resul…
An important family of structural constants in the theory of symmetric functions and in the representation theory of symmetric groups and general linear groups are the plethysm coefficients. In 1950, Foulkes observed that they have some stability properties: certain sequences of plethysm coefficients are eventually constant. Such stability properties were proven by Brion with geometric techniques, and by Thibon and Carré by means of vertex operators. In this paper we present a new approach to prove such stability properties.Our proofs are purely combinatorial and follow the same scheme. We dec…
The natural representation of the quantized affine algebra of type A can be defined via the deformed Fock space by Misra and Miwa. This relates the classes of Weyl modules for a type A quantum group at a root of unity to the action of the quantized affine algebra as the rank tends towards infinity. In this paper we investigate the situation outside of type A. In classical types, we construct embeddings of the Grothendieck group of finite dimensional modules for the corresponding quatum group at a root of unity into Fock spaces of different charges and define an action of an affine quantum symm…
We give a complete list of indecomposable characters of the infinite symmetric semigroup. In comparison with the analogous list for the infinite symmetric group, one should introduce only one new parameter, which has a clear combinatorial meaning. The paper relies on the representation theory of the finite symmetric semigroups and the representation theory of the infinite symmetric group.
In the computation of the intersection cohomology of Shimura varieties, or of the $L^2$ cohomology of equal rank locally symmetric spaces, combinatorial identities involving averaged discrete series characters of real reductive groups play a large technical role. These identities can become very complicated and are not always well-understood (see for example the appendix of [8]). We propose a geometric approach to these identities in the case of Siegel modular varieties using the combinatorial properties of the Coxeter complex of the symmetric group. Apart from some introductory remarks about …
The paper is devoted to the study of some well-knonw combinatorial functions on the symmetric group $\sn$ --- the major index $\maj$, the descent number $\des$, and the inversion number $\inv$ --- from the representation-theoretic point of view. We show that each of these functions generates in the group algebra the same ideal, and the restriction of the left regular representation to this ideal is isomorphic to the representation of $\sn$ in the space of $n\times n$ skew-symmetric matrices. This allows us to obtain formulas for the functions $\maj,\des,\inv$ in terms of matrices of an excepti…
We classify all irreducible admissible representations of three Olshanski pairs connected to the infinite symmetric group. In particular, our methods yield two simple proofs of the classical Thoma's description of the characters of the infinite symmetric group. Also, we discuss a certain operation called mixture of representations which provides a uniform construction of all irreducible admissible representations.
For any set representation (permutation representation) of the symmetric group $S_n$, we give combinatorial interpretation for coefficients of its Frobenius character expanded in the basis of monomial symmetric functions.
We determine all the multiplicity-free representations of the symmetric group. This project is motivated by a combinatorial problem involving systems of set-partitions with a specific pattern of intersection.
We review and introduce several approaches to the study of centralizer algebras of the infinite symmetric group $S_\infty$. Our study is led by the double commutant relationships between finite symmetric groups and partition algebras; each approach produces a centralizer algebra that is contained in a partition algebra. Our goal is to incorporate invariants of $S_\infty$, which ties our work to the study of symmetric functions in non-commuting variables. We resultantly explore sequence spaces as permutation modules, which yields families of non-unitary representations of $S_\infty$.
We consider a product of three copies of infinite symmetric group and its representations spherical with respect to the diagonal subgroup. We show that such representations generate functors from a certain category of simplicial two-dimensional surfaces to the category of Hilbert spaces and bounded linear operators.
In this paper, we review the representation theory of the infinite symmetric group, and we extend the works of Kerov and Vershik by proving that the irreducible characters of the infinite symmetric group always satisfy a central limit theorem. Hence, for any point of the Thoma simplex, the corresponding measures on the levels of the Young graph have a property of gaussian concentration. By using the Robinson-Schensted-Knuth algorithm and the theory of Pitman operators, we relate these results to the properties of certain random permutations obtained by riffle shuffles, and to the behaviour of …
We show that the class of inductive limits of the representations of finite symmetric groups with simple spectrum coinsides with the class of Markov representations of the infinite symmetric group associated with Markov measures on the space of infinite Young tableaux. We also show that the representations of infinite symmetric group induced from identity representation of two-block Young subgroup are Markov representations and find explicit formulas for transition probabilities of corresponding Markov measure on the Young diagrmas. Induced two-row representations of finite symmetric group are…
