Gheri's conjecture on the p-Frobenius ratio

About 6 years old · traced to

Let GG be a finite group and let pp be a prime dividing ∣G∣|G|. Define

Up(G)=⋃P∈Syl⁡p(G)P\mathfrak{U}_p(G)=\bigcup_{P\in \operatorname{Syl}_p(G)}P

to be the set of pp-elements of GG. If PP is a Sylow pp-subgroup of GG, the positive integer ∣Up(G)∣/∣P∣|\mathfrak{U}_p(G)|/|P| is called the pp-Frobenius ratio of GG, and let np(G)n_p(G) denote the number of Sylow pp-subgroups of GG.

Gheri's conjecture. The pp-Frobenius ratio satisfies

∣Up(G)∣∣P∣≥np(G)1−1p.\frac{|\mathfrak{U}_p(G)|}{|P|}\geq n_p(G)^{1-\frac{1}{p}}.

The conjecture seeks a lower bound for the Frobenius ratio in terms of the number of Sylow pp-subgroups. The ratio is known to be a positive integer by Frobenius' theorem, but its broader combinatorial meaning and the proposed bound remain open in general.

References

Primary source

Pietro Gheri, “On the number of p-elements in a finite group”, arXiv:2007.00967 (2020).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.