2000 character limit reached
A lower bound on the size of maximal abelian subgroups (2402.12221v1)
Published 19 Feb 2024 in math.GR
Abstract: Let $G$ be a $p$-group for some prime $p$. Let $n$ be the positive integer so that $|G:Z(G)| = pn$. Suppose $A$ is a maximal abelian subgroup of $G$. Let $$pl = {\rm max} {|Z(C_G (g)):Z(G)| : g \in G \setminus Z(G)},$$ $$pb = {\rm max} {|cl(g)| : g \in G \setminus Z(G) },$$ and $pa = |A:Z(G)|$. Then we show that $a \ge n/(b+l)$.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.