Related papers: The one-sided cycle shuffles in the symmetric grou…

Let $\alpha(n)$ denote the number of perfect square permutations in the symmetric group $S_n$. The conjecture $\alpha(2n+1) = (2n+1) \alpha(2n)$, provided by Stanley[4], was proved by Blum[1] using a generating function. This paper presents…

The overhand shuffle is one of the ``real'' card shuffling methods in the sense that some people actually use it to mix a deck of cards. A mathematical model was constructed and analyzed by Pemantle [J. Theoret. Probab. 2 (1989) 37--49] who…

We consider symmetric separately radial (with corresponding group $S_n\rtimes \mathbb{T}^n$) and alternating separately radial (with corresponding group $A_n\rtimes \mathbb{T}^n$) symbols, as well as the associated Toeplitz operators on the…

We define a commuting family of operators $T_0,T_1,...,T_n$ in the Temperley--Lieb algebra $\mathcal{A}_n(x)$ of type $A_{n-1}$. Using an appropriate analogue to Murphy basis of the Iwahori--Hecke algebra of the symmetric group, we describe…

We construct a novel family of difference-permutation operators and prove that they are diagonalized by the wreath Macdonald $P$-polynomials; the eigenvalues are written in terms of elementary symmetric polynomials of arbitrary degree. Our…

In operator algebra, the linearization trick is a technique that reduces the study of a non-commutative polynomial evaluated at elements of an algebra A to the study of a polynomial of degree one, evaluated on the enlarged algebra A x M r…

We define three families of quivers in which the braid relations of the symmetric group $S_n$ are realized by mutations and automorphisms. A sequence of eight braid moves on a reduced word for the longest element of $S_4$ yields three…

We discuss a notion of shuffle for trees which extends the usual notion of a shuffle for two natural numbers. We give several equivalent descriptions, and prove some algebraic and combinatorial properties. In addition, we characterize…

In this paper we study the eigenvalues of the laplacian matrices of the cyclic graphs with one edge of weight $\alpha$ and the others of weight $1$. We denote by $n$ the order of the graph and suppose that $n$ tends to infinity. We notice…

We give a cyclic sieving phenomenon for symplectic $\lambda$-tableaux $SP(\lambda,2m)$, where $\lambda$ is a partition of an odd integer $n$ and $gcd(m,p)=1$ for any odd prime $p\leq n$. We use the crystal structure on Kashiwara-Nakashima…

Let $X$ be a character table of the symmetric group $S_n$. It is shown that unless $n = 4$ or $n=6$, there is a unique way to assign partitions of $n$ to the rows and columns of $X$ so that for all $\lambda$ and $\nu$, $X_{\lambda\nu}$ is…

In this paper, we introduce a notion of a left-symmetric algebroid, which is a generalization of a left-symmetric algebra from a vector space to a vector bundle. The left multiplication gives rise to a representation of the corresponding…

We develop a new approach for approximating large independent sets when the input graph is a one-sided spectral expander - that is, the uniform random walk matrix of the graph has its second eigenvalue bounded away from 1. Consequently, we…

Let $G$ be a linear semisimple algebraic group and $B$ its Borel subgroup. Let $\mathbb{T}\subset B$ be the maximal torus. We study the inductive construction of Bott-Samelson varieties to obtain recursive formulas for the twisted motivic…

We introduce a new basis of the group algebra of the symmetric group, built using the left-to-right minima sets of permutations. We show that on this basis, the descent algebra acts by triangular operators, thus making it an analogue of a…

We analyze the mixing time of a popular shuffling machine known as the shelf shuffler. It is a modified version of a $2m$-handed riffle shuffle ($m=10$ in casinos) in which a deck of $n$ cards is split multinomially into $2m$ piles, the…

The joint spectral theory of a system of pairwise commuting self-adjoint left-invariant differential operators L_1,...,L_n on a connected Lie group G is studied, under the hypothesis that the algebra generated by them contains a "weighted…

We study the Gilbert-Shannon-Reeds model for riffle shuffles and ask 'How many times must a deck of cards be shuffled for the deck to be in close to random order?'. In 1992, Bayer and Diaconis gave a solution which gives exact and…

We relate shuffle algebras, as defined by Nichols, Feigin-Odesskii and Rosso, to perverse sheaves on symmetric products of the complex line (i.e., on the spaces of monic polynomials stratified by multiplicities of roots). More precisely, we…

Here we consider two algebras, a free unital associative complex algebra (denoted by ${\mathcal{B}}$) equiped with a multiparametric \textbf{\emph{q}}-differential structure and a twisted group algebra (denoted by ${\mathcal{A}(S_{n})}$),…