Related papers: Combinatorics of asymptotic representation theory

The paper studies how to compute irreducible characters of the generalized symmetric group $C_k\wr{S}_n$ by iterative algorithms. After reproving the Ariki-Koike version of the Murnaghan-Nakayama rule by vertex algebraic methods, we…

Finding upper bounds for character ratios is a fundamental problem in asymptotic group theory. Previous bounds in the symmetric group have led to remarkable applications in unexpected domains. The existing approaches predominantly relied on…

We attempt to survey the field of combinatorial representation theory, describe the main results and main questions and give an update of its current status. We give a personal viewpoint on the field, while remaining aware that there is…

A new family of polynomials, called cumulant polynomial sequence, and its extensions to the multivariate case is introduced relied on a purely symbolic combinatorial method. The coefficients of these polynomials are cumulants, but depending…

We study asymptotics of random shifted Young diagrams which correspond to a given sequence of reducible projective representations of the symmetric groups. We show limit results (Law of Large Numbers and Central Limit Theorem) for their…

Conrey, Farmer, Keating, Rubinstein and Snaith have given a recipe that conjecturally produces, among others, the full moment polynomial for the Riemann zeta function. The leading term of this polynomial is given as a product of a factor…

Given natural numbers m and n, we define a deflation map from the characters of the symmetric group S_{mn} to the characters of S_n. This map is obtained by first restricting a character of S_{mn} to the wreath product S_m \wr S_n, and then…

We introduce a combinatorial characterization of simpliciality for arrangements of hyperplanes. We then give a sharp upper bound for the number of hyperplanes of such an arrangement in the projective plane over a finite field, and present…

Combinatorics is a fundamental mathematical discipline as well as an essential component of many mathematical areas, and its study has experienced an impressive growth in recent years. One of the main reasons for this growth is the tight…

Many finite groups, including all finite non-abelian simple groups, can be symmetrically generated by involutions. In this paper we give an algorithm to symmetrically represent elements of finite groups and to transform symmetrically…

For a finite group $G,$ we define the concept of $G$-partial permutation and use it to show that the structure coefficients of the center of the wreath product $G\wr \mathcal{S}_n$ algebra are polynomials in $n$ with non-negative integer…

An objective of the theory of combinatorial groupoids is to introduce concepts like "holonomy", "parallel transport", "bundles", "combinatorial curvature" etc. in the context of simplicial (polyhedral) complexes, posets, graphs, polytopes,…

In the 90's a collection of Plethystic operators were introduced in [3], [7] and [8] to solve some Representation Theoretical problems arising from the Theory of Macdonald polynomials. This collection was enriched in the research that led…

In the 40s, Mayer introduced a construction of (simplicial) $p$-complex by using the unsigned boundary map and taking coefficients of chains modulo $p$. We look at such a $p$-complex associated to an $(n-1)$-simplex; in which case, this is…

Schur-Weyl duality is a fundamental framework in combinatorial representation theory. It intimately relates the irreducible representations of a group to the irreducible representations of its centralizer algebra. We investigate the analog…

In this paper, we study relationships between the normalized characters of symmetric groups and the Boolean cumulants of Young diagrams. Specifically, we show that each normalized character is a polynomial of twisted Boolean cumulants with…

In this note we develop a systematic combinatorial definition for constructed earlier supersymmetric polynomial families. These polynomial families generalize canonical Schur, Jack and Macdonald families so that the new polynomials depend…

K\"ulshammer, Olsson, and Robinson developed an l-analogue of modular representation theory of symmetric groups where l is not necessarily a prime. They gave a conjectural combinatorial description for invariant factors of the Cartan matrix…

This paper introduces new structural decompositions for almost symmetric numerical semigroups through the combinatorial lens of Young diagrams. To do that, we use the foundational correspondence between numerical sets and Young diagrams,…

Cylindric Young tableaux are combinatorial objects that first appeared in the 1990s. A natural extension of the classical notion of a Young tableau, they have since been used several times, most notably by Gessel and Krattenthaler and by…