Search arXivSearch

arXiv · 2601.21195

$q$-deformations of the Tsetlin library

Abstract

The Tsetlin library is a random shuffling process on permutations of $n$ letters, where each letter $i$ can be interpreted as a book; book $i$ is brought to the front of the bookshelf with an assigned probability $x_i$. We define a $q$-deformation of the Tsetlin library by replacing the symmetric group action on permutations by the action of the type $A$ Iwahori-Hecke algebra. We compute the stationary distribution and spectrum of this Markov chain by relating it to a Markov chain on complete flags over the finite field vector space $\mathbb{F}_q^n$ and applying techniques from semigroup theory. We prove that for a natural choice of $x_i$ the total variation distance mixing time of the $q$-Tsetlin library on permutations of $n$ is $O(n)$ compared to $Θ(n \log n)$ for the Tsetlin library at $q=1$, which demonstrates a phase transition. We also generalize the $q$-Tsetlin library to words (with repeated letters), and compute its stationary distribution and spectrum.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Arvind Ayyer, Sarah Brauner, Jan de Gier, Anne Schilling. 2026-04-02. $q$-deformations of the Tsetlin library. https://arxiv.org/abs/2601.21195

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Rooted Spider Embeddings and the Erd\H os-Sós Conjecture

Under a local density condition, we prove that every $k$-edge spider embeds at any prescribed center of degree at least $k$, unless all legs are even and the host graph has one of two specified structures. These structures contain complete bipartite subgraphs with prescribed neighborhoods. The proof uses path rerouting and three exchange lemmas that describe equality in neighborhood estimates. As a consequence, we recover the Erd\H os-Sós bound for all spiders.

math.CO

Generalized Goulden-Yong duals and signed minimal factorizations

In this paper, we give two combinatorial ways to study signed exceptional sequences. First, we show the equivalence between one-way reflections and relatively projective representations. Secondly, we construct generalized Goulden-Yong duals using reverse Garside element actions and folded chord diagrams. We then give two applications of the generalized Goulden-Yong duals: constructing generalized Prüfer codes and counting signed factorizations using the matrix-tree theorem.

math.CO

Explicit expressions for iterates of power series

We present several formulas for both the discrete and fractional iterates of an invertible power series $f$, using a new unifying approach based on umbral calculus. Known formulas are extended, and their proofs simplified, while new expressions are introduced. In particular, by employing $q$-calculus identities, we eliminate the requirement for $f'(0)$ to equal $1$ and the resulting general expressions for the iterative logarithm are obtained as well.

math.CO