
arXiv: 2501.17806
ABSTRACT A finite group is mixable if a product of random elements, each chosen independently from two options, can distribute uniformly on . We present conditions and obstructions to mixability. We show that 2‐groups, the symmetric groups, the simple alternating groups, several matrix and sporadic simple groups, and most finite Coxeter groups, are mixable. We also provide bounds on the mixing length of such groups.
Probability (math.PR), FOS: Mathematics, Group Theory (math.GR), Representation Theory (math.RT), Mathematics - Group Theory, Mathematics - Probability, Mathematics - Representation Theory
Probability (math.PR), FOS: Mathematics, Group Theory (math.GR), Representation Theory (math.RT), Mathematics - Group Theory, Mathematics - Probability, Mathematics - Representation Theory
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 0 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
