相关论文: The representation theory of somewhere-to-below sh…

Given a positive integer $n$, we consider the group algebra of the symmetric group $S_{n}$. In this algebra, we define $n$ elements $t_{1},t_{2},\ldots,t_{n}$ by the formula \[…

We study a family of shuffling operators on the symmetric group $S_n$, which includes the top-to-random shuffle. The general shuffling scheme consists of removing one card at a time from the deck (according to some probability distribution)…

We study the "top-to-random-and-reverse shuffle", defined as the top-to-random shuffle in the symmetric group algebra composed with the permutation $w_0$ (which sends each $i$ to $n+1-i$). More generally, we analyze the composition of any…

Analogues of 1-shuffle elements for complex reflection groups of type $G(m,1,n)$ are introduced. A geometric interpretation for $G(m,1,n)$ in terms of rotational permutations of polygonal cards is given. We compute the eigenvalues, and…

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…

Multiplicative analogues of the shuffle elements of the braid group rings are introduced; in local representations they give rise to certain graded associative algebras (b-shuffle algebras). For the Hecke and BMW algebras, the…

For the general linear group $GL_n(k)$ over an algebraically closed field $k$ of characteristic $p$, there are two types of "twisting" operations that arise naturally on partitions. These are of the form $\lambda \rightarrow p\lambda$ and…

A permutation is defined to be cycle-up-down if it is a product of cycles that, when written starting with their smallest element, have an up-down pattern. We prove bijectively and analytically that these permutations are enumerated by the…

Let $S_n$ denote the symmetric group of permutations acting on $n$ elements. We investigate the double sequence $\{N_{\ell}(n)\}$ counting the number of $\ell$ tuples of elements of the symmetric group $S_n$, where the components commute,…

Let $ (\rho, V) $ be an irreducible representation of the symmetric group $ S_n$ (or the alternating group $ A_n$), and let $ g $ be a permutation on $n$ letters with each of its cycle lengths divides the length of its largest cycle. We…

We consider the algebra of Hecke correspondences (elementary transformations at a single point) acting on the algebraic K-theory groups of the moduli spaces of stable sheaves on a smooth projective surface S. We derive quadratic relations…

We generalize the shuffle theorem and its $(km,kn)$ version, as conjectured by Haglund et al. and Bergeron et al., and proven by Carlsson and Mellit, and Mellit, respectively. In our version the $(km,kn)$ Dyck paths on the combinatorial…

We develop a combinatorial and order-theoretic framework for shuffles, understood as ordered concatenations of indexed families of sequences that induce total orders on the natural numbers. Motivated by the classical \v{S}arkovski\u{i}…

Let $H$ be a permutation group on a set $\Lambda$, which is permutationally isomorphic to a finite alternating or symmetric group $A_n$ or $S_n$ acting on the $k$-element subsets of points from $\{1,\ldots,n\}$, for some arbitrary but fixed…

The commutative trigonometric shuffle algebra ${\mathrm A}$ is a space of symmetric rational functions satisfying certain wheel conditions. We describe a ring isomorphism between ${\mathrm A}$ and the center of the Hecke algebra using a…

These are detailed lecture notes of the crash-course on shuffle algebras delivered by the author at Tokyo University of Marine Science and Technology during the second week of March 2019. These notes consist of three chapters, providing a…

A permutation statistic $\operatorname{st}$ is said to be shuffle-compatible if the distribution of $\operatorname{st}$ over the set of shuffles of two disjoint permutations $\pi$ and $\sigma$ depends only on $\operatorname{st}\pi$,…

The rising algebra is a subalgebra of the group algebra of the symmetric group S_n, gotten by lumping together permutations having the same number of rising sequences. This well-known algebra arises naturally when studying riffle shuffles.…

The shuffle conjecture of Haglund et al. expresses the symmetric function $\nabla e_n$ as a sum over labeled Dyck paths. Here $\nabla$ is an operator on symmetric functions defined in terms of its diagonal action on the basis of modified…

We present a proof of the compositional shuffle conjecture, which generalizes the famous shuffle conjecture for the character of the diagonal coinvariant algebra. We first formulate the combinatorial side of the conjecture in terms of…