文章基本信息

标题：Perfect shuffling by lazy swaps
本地全文：下载
作者：Omer Angel ; Alexander E. Holroyd
期刊名称：Electronic Communications in Probability
印刷版ISSN：1083-589X
出版年度：2018
卷号：23
DOI：10.1214/18-ECP151
语种：English
出版社：Electronic Communications in Probability
摘要：We characterize the minimum-length sequences of independent lazy simple transpositions whose composition is a uniformly random permutation. For every reduced word of the reverse permutation there is exactly one valid way to assign probabilities to the transpositions. It is an open problem to determine the minimum length of such a sequence when the simplicity condition is dropped.