On counting centralizer subgroups of symmetric groups
Combinatorics
2023-06-28 v1
Abstract
Let be the symmetric group, and . We consider the structure of for any . We prove the permutations which makes have size of polynomial in have density zero.
Cite
@article{arxiv.1910.01611,
title = {On counting centralizer subgroups of symmetric groups},
author = {Zhipeng Lu},
journal= {arXiv preprint arXiv:1910.01611},
year = {2023}
}