On counting centralizer subgroups of symmetric groups

Abstract

Let S2m be the symmetric group, h=(1\ 2)(3\ 4)·s(2m-1\ 2m) and H=C(h). We consider the structure of gHg-1 H for any g∈ S2m. We prove the permutations g which makes gHg-1 H have size of polynomial in m have density zero.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…