Random Permutations from Bott-Samelson Varieties

Abstract

Motivated by a recent random pipe dream model, we study a family of probability distributions on \(Sn\) arising from Bott--Samelson varieties over finite fields. More precisely, for a word \(R\), we consider the Bott--Samelson map \(πR:BSR Fn\) and define a distribution \(PR,q\) by counting the \(Fq\)-points in the inverse images of Schubert cells. For a suitable choice of parameters \(p1=q/(1+q)\) and \(p2=1/q\), this construction recovers a special case of the random pipe dream distribution. The main problem considered in this note is to determine which combinatorial properties of a reduced word are detected by the distribution \(PR,q\). We prove the stronger statement that, for arbitrary reduced words \(R1,R2\), the equality \(PR1,q=PR2,q\) as functions of \(q\) holds if and only if \(R1\) and \(R2\) lie in the same commutation class. In particular, equality of distributions already forces the two words to represent the same permutation. The proof combines the Bott--Samelson interpretation with Demazure products, commutation-class invariants, and Hecke-algebraic arguments.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…