A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is
We study permutation groups of given minimal degree without the classical primitivity assumption. We provide sharp upper bounds on the order of a permutation group H Ä S n of minimal degree m and on the number of its elements of any given support. These results contribute to the foundations of a non-commutative coding theory. A main application of our results concerns the Hidden Subgroup Problem for S n in quantum computing. We completely characterize the hidden subgroups of S n that can bedoi:10.4171/ggd/24 fatcat:bhe56se7szbszbhjkgj6bbfhwy