1 citations
2 papers
math.CO2005★ 1 cited
Permutation polytopes and indecomposable elements in permutation groups
Robert Guralnick, David Perkinson
Each group G of nxn permutation matrices has a corresponding permutation polytope, P(G):=conv(G) in R^{nxn}. We relate the structure of P(G) to the transitivity of G. In particular…
math.PR2004
Random Multiplication Approaches Uniform Measure in Finite Groups
Aaron Abrams, Henry Landau, Zeph Landau +2
In order to study how well a finite group might be generated by repeated random multiplications, P. Diaconis suggested the following urn model. An urn contains some balls labeled b…