Related papers: Combinatorics of asymptotic representation theory
We consider a combinatorial problem occurring naturally in a group theoretical setting and provide a constructive solution in a special case. More precisely, in 1999 the author established a logarithmic bound for the derived length of the…
An axiomatic approach to the representation theory of Coxeter groups and their Hecke algebras was presented in [1]. Combinatorial aspects of this construction are studied in this paper. In particular, the symmetric group case is…
We introduce the notion of "color rules" for computing class functions of $Z_k \wr S_n$, where $Z_k$ is the cyclic group of order $k$ and $S_n$ is the symmetric group on $n$ letters. Using a general sign-reversing involution and a map of…
In this short review we introduce group field theory, a particular class of random tensor models, which represents nowadays one of the candidates for a fundamental theory of quantum gravity. We insist on the combinatorial richness of…
We prove a factorization-concentration result for characters of symmetric groups. This is then applied to the asymptotic behaviour of the decomposition of the tensor representations. There are connections with the Pastur-Marcenko…
Let X be a locally compact space, and let A and B be Co(X)-algebras. We define the notion of an asymptotic Co(X)-morphism from A to B and construct representable E-theory groups RE(X;A,B). These are the universal groups on the category of…
We develop a new method for studying the asymptotics of symmetric polynomials of representation-theoretic origin as the number of variables tends to infinity. Several applications of our method are presented: We prove a number of theorems…
The combination of the group ring setting with the methods of character theory allows an elegant and powerful analysis of various combinatorial structures, via their character sums. These combinatorial structures include difference sets,…
A foundation is laid for a theory of combinatorial groupoids, allowing us to use concepts like ``holonomy'', ``parallel transport'', ``bundles'', ``combinatorial curvature'' etc. in the context of simplicial (polyhedral) complexes, posets,…
We construct a new class of symmetric algebras of tame representation type that are also the endomorphism algebras of cluster tilting objects in 2-Calabi-Yau triangulated categories, hence all their non-projective indecomposable modules are…
We bound the number of standard tableaux of skew shapes via thick hook decompositions in the Naruse hook length formula. Combining this with elementary counting arguments in the Murnaghan--Nakayama rule, we establish a uniform bound on…
We discuss implications of the following statement about the representation theory of symmetric groups: every integer appears infinitely often as an irreducible character evaluation, and every nonnegative integer appears infinitely often as…
Consider an $n\times k$ matrix of i.i.d. Bernoulli random numbers with $p=1/2$. Dual RSK algorithm gives a bijection of this matrix to a pair of Young tableaux of conjugate shape, which is manifestation of skew Howe $GL_{n}\times…
We study the structure of the asymptotic expansion of the probability that a combinatorial object is connected. We show that the coefficients appearing in those asymptotics are integers and can be interpreted as the counting sequences of…
We discuss three distinct topics of independent interest; one in enumerative combinatorics, one in symmetric function theory, and one in algebraic geometry. The topic in enumerative combinatorics concerns a q-analog of a generalization of…
In this paper, we review the theory of time space-harmonic polynomials developed by using a symbolic device known in the literature as the classical umbral calculus. The advantage of this symbolic tool is twofold. First a moment…
A finite spin system invariant under a symmetry group G is a very illustrative example of the finite group action on a set of mappings f:X->Y. In the case of spin systems X is a set of spin carriers and Y contains 2s+1 z-components -s<=m<=s…
We discuss the use of methods coming from integrable systems to study problems of enumerative and algebraic combinatorics, and develop two examples: the enumeration of Alternating Sign Matrices and related combinatorial objects, and the…
This expository paper is based on the lectures given at the program `Modular Representation Theory of Finite and $p$-adic Groups' at the National University of Singapore. We are concerned with recent results on representation theory and…
We start with definitions of the general notions of the theory of $\Bbb Z_{2}$-graded algebras. Then we consider theory of inductive families of $\Bbb Z_{2}$-graded semisimple finite-dimensional algebras and its representations in the…