Random permutations from -Demazure products
arXiv:2604.06532
Abstract
We study the -deformation of the Demazure product model from arXiv:2407.21653. Consider the longest element in written as a reduced word in simple transpositions. Independently delete each transposition with probability and apply the -Demazure product to the remaining ones. We show that the law of the resulting permutation converges as to a deterministic permuton, which coincides with the case studied in arXiv:2407.21653 for adjusted probability . This resolves Conjecture 1.13 from arXiv:2407.21653 and identifies the limiting permuton explicitly.
14 pages, 3 figures