A new algorithm estimates orbit counts by multiplying estimates of orbit-count ratios from Burnside process samples, and estimates k(U_n(F_q)) for q=2,3 up to n=32.
Poisson approximation for large permutation groups
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
abstract
Let $G_{k,n}$ be a group of permutations of $kn$ objects which permutes things independently in disjoint blocks of size $k$ and then permutes the blocks. We investigate the probabilistic and/or enumerative aspects of random elements of $G_{k,n}$. This includes novel limit theorems for fixed points, cycles of various lengths, number of cycles and inversions. The limits are compound Poisson distributions with interesting dependence structure.
citation-role summary
background 1
citation-polarity summary
fields
math.PR 1years
2025 1verdicts
CONDITIONAL 1roles
background 1polarities
unclear 1representative citing papers
citing papers explorer
-
Counting the number of group orbits by marrying the Burnside process with importance sampling
A new algorithm estimates orbit counts by multiplying estimates of orbit-count ratios from Burnside process samples, and estimates k(U_n(F_q)) for q=2,3 up to n=32.