Related papers: Combinatorics of asymptotic representation theory
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…
The branching theorem expresses irreducible character values for the symmetric group $S_n$ in terms of those for $S_{n-1}$, but it gives the values only at elements of $S_n$ having a fixed point. We extend the theorem by providing a…
Even with the introduction of supercharacter theories, the representation theory of many unipotent groups remains mysterious. This paper constructs a family of supercharacter theories for normal pattern groups in a way that exhibit many of…
A combinatorial approach to free probability theory has been developped by Roland Speicher, based on the notion of noncrossing cumulants, a free analogue of the classical theory of cumulants in probability theory. We review this theory, and…
Representation theory of the symmetric group $\mathfrak{S}_n$ has a very distinctive combinatorial flavor. The conjugacy classes as well as the irreducible characters are indexed by integer partitions $\lambda \vdash n$. We introduce class…
It is described the group of arrowy permutations (that is extension of symmetric group) and the consequent process of generation of GL(n) and some its subgroups by this combinatoric group and its subgroups.
In this thesis, we investigate the asymptotics of random partitions chosen according to probability measures coming from the representation theory of the symmetric groups $S_n$ and of the finite Chevalley groups $GL(n,F_q)$ and…
We review some recent advances in modular representation theory of symmetric groups and related Hecke algebras. We discuss connections with Khovanov-Lauda-Rouquier algebras and gradings on the blocks of the group algebras $F\Sigma_n$, which…
Analytic combinatorics studies asymptotic properties of families of combinatorial objects using complex analysis on their generating functions. In their reference book on the subject, Flajolet and Sedgewick describe a general approach that…
Free cumulants are nice and useful functionals of the shape of a Young diagram, in particular they give the asymptotics of normalized characters of symmetric groups S(n) in the limit n\to\infty. We give an explicit combinatorial formula for…
In a preprint released in 2016, Daniel Grayson introduces a conjectural presentation of the (higher) relative algebraic $K$-groups using purely combinatorial means. In this paper, we will show that this presentation is isomorphic to the…
Stanley considered suitably normalized characters of the symmetric groups on Young diagrams having a special geometric form, namely multirectangular Young diagrams. He proved that the character is a polynomial in the lengths of the sides of…
Framed combinatorial topology is a novel theory describing combinatorial phenomena arising at the intersection of stratified topology, singularity theory, and higher algebra. The theory synthesizes elements of classical combinatorial…
The symmetric group S_n possesses a nontrivial central extension, whose irreducible representations, different from the irreducible representations of S_n itself, coincide with the irreducible representations of a certain algebra A_n.…
We construct new examples of non-nil algebras with any number of generators, which are direct sums of two locally nilpotent subalgebras. As all previously known examples, our examples are contracted semigroup algebras and the underlying…
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…
Kerov considered the normalized characters of irreducible representations of the symmetric group, evaluated on a cycle, as a polynomial in free cumulants. Biane has proved that this polynomial has integer coefficients, and made various…
Young diagrams are ubiquitous in combinatorics and representation theory. Here we explain these diagrams, focusing on how they are used to classify representations of the symmetric groups $S_n$ and various "classical groups": famous groups…
Determining the relationship between composite systems and their subsystems is a fundamental problem in quantum physics. In this paper we consider the spectra of a bipartite quantum state and its two marginal states. To each spectrum we can…
Arithmetic combinatorics is often concerned with the problem of bounding the behaviour of arbitrary finite sets in a group or ring with respect to arithmetic operations such as addition or multiplication. Similarly, combinatorial geometry…