[Paper Review] Eigenvalues of symmetrized shuffling operators

Nadia Lafrenière|arXiv (Cornell University)|Nov 17, 2018

Advanced Combinatorial Mathematics11 references4 citations

TL;DR

This paper provides a combinatorial method to compute all eigenvalues of symmetrized shuffling operators $ uk$ introduced by Reiner, Saliola, and Welker, proving they are integers (up to rescaling). Using tableaux and representation theory of the symmetric group, it decomposes the action of $ uk$ on permutation modules and links eigenvalues to semistandard tableaux, generalizing the random-to-random shuffle and confirming a long-standing conjecture.

ABSTRACT

This paper describes a combinatorial way of obtaining all the eigenvalues of the symmetrized shuffling operators introduced by Victor Reiner, Franco Saliola and Volkmar Welker. It allows us to prove their conjecture that these eigenvalues are integers. This work generalizes the case of the random-to-random Markov chain.

Motivation & Objective

• To provide a combinatorial method for computing all eigenvalues of the symmetrized shuffling operators $ uk$ introduced by Reiner, Saliola, and Welker.
• To prove their conjecture that all eigenvalues of $ uk$ are integers (up to rescaling).
• To generalize the eigenvalue computation from the random-to-random shuffle to a broader class of operators that move $k$ elements at once.
• To establish a framework for analyzing eigenvalues of other symmetrized shuffling operators, such as $ uk$ and $ uk$, using representation theory and tableaux.

Proposed method

• The method uses the decomposition of the group algebra $ȂS_n$ into permutation modules $M^\lambda$, indexed by integer partitions $\lambda$, with bases formed by words of content $\lambda$.
• It applies Young's rule to decompose $M^\mu$ into Specht modules $S^\lambda$, where the multiplicity $m_{\lambda,\mu}$ is the number of semistandard tableaux of shape $\lambda$ and content $\mu$.
• Eigenvalues of $\nuk$ are computed by restricting the operator to Specht modules $S^\lambda$, leveraging Schur's lemma, which ensures a single eigenvalue per simple module.
• The eigenvalue for a given $S^\lambda$ is determined by the number of semistandard tableaux of shape $\lambda$ and content $\mu$, where $\mu$ is the content of the word, and by the action of the Schützenberger $\Delta$ operator on tableaux.
• The kernel of $\nuk$ is characterized as the direct sum of Specht modules $S^{\operatorname{shape}(t)}$ over all standard tableaux $t$ of type less than $k$, based on results from Reiner, Saliola, and Welker.
• The key formula for eigenvalues is derived via Theorem 2, which computes eigenvalues using the number of semistandard tableaux and the dominance order on partitions.

Experimental results

Research questions

• RQ1 Are all eigenvalues of the symmetrized shuffling operators $\nuk$ integers (up to rescaling), as conjectured by Reiner, Saliola, and Welker?
• RQ2 Can a general combinatorial method be developed to compute all eigenvalues of $\nuk$ for any $k$ and $n$, beyond the random-to-random case?
• RQ3 How do the eigenvalues of $\nuk$ relate to the representation theory of the symmetric group, particularly through Specht modules and tableaux?
• RQ4 What is the structure of the kernel of $\nuk$, and how does it relate to the type and shape of standard tableaux?
• RQ5 Can this framework be extended to other symmetrized shuffling operators, such as $\gamma_k$, that commute pairwise?

Key findings

• The eigenvalues of the symmetrized shuffling operators $\nuk$ are proven to be integers (up to rescaling), confirming the conjecture by Reiner, Saliola, and Welker.
• For words of content $(2,2)$, the operator $\nuk$ on $\nu_2$ has eigenvalues $72$, $20$, and $0$ with multiplicities $1$, $1$, and $4$, respectively.
• The non-zero eigenvalues of $\nuk$ are computed via Theorem 2 using the number of semistandard tableaux of shape $\lambda$ and content $\mu$, where $\lambda$ dominates $\mu$.
• The kernel of $\nuk$ is isomorphic to the direct sum of Specht modules $S^{\operatorname{shape}(t)}$ over all standard tableaux $t$ of type less than $k$, as established in equation (4.1).
• The eigenvalue associated with a Specht module $S^\lambda$ is determined by the number of semistandard tableaux of shape $\lambda$ and content $\mu$, which gives the multiplicity of $S^\lambda$ in the decomposition of $M^\mu$.
• The method generalizes the random-to-random shuffle case, where eigenvalues were previously known via Dieker and Saliola, and extends them to $k > 1$.