ProbXiv
Explorersign in
Problem archiveProblem record

Statement

For a finite group GG, let i(G)i(G) be the number of isomorphism classes of non-identity proper subgroups of GG, let c(G)c(G) be the number of conjugacy classes of such subgroups, let s(G)s(G) be the number of conjugacy classes of such self-normalising subgroups, and let n(G)n(G) be the number of conjugacy classes of such non-self-normalising subgroups. A subgroup H≤GH\leq G is self-normalising when H=NG(H)H=N_G(H). Let G=PSL2(p)G={\rm PSL}_2(p) for a prime pp. Extremal subgroup-count conjecture. There is an infinite set of primes pp for which G=PSL2(p)G={\rm PSL}_2(p) satisfies

i(G)=17,c(G)=18,s(G)=6,n(G)=12.i(G)=17,\qquad c(G)=18,\qquad s(G)=6,\qquad n(G)=12.

Theorem-level lower bounds show that these are the minimum values under consideration for all sufficiently large primes, and computational evidence has found more than 1.2×1061.2\times 10^6 primes attaining all four bounds. The conjecture asserts that this phenomenon occurs for infinitely many primes.

Record

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.