Math-6732 · mathematics · Group theory

Math-6732

Direct McKay Reduction for Self-Normalizing Sylow Two-Subgroups

Status Open · unsolvedmath.comLLM status Open unverified

Top Open Problems Not reported cataloguedOpenOpen

Statement

Definitions and mathematical statement

Let $G$ be a finite group and let $P\in\operatorname{Syl}_2(G)$, so that $P$ has order equal to the largest power of $2$ dividing $|G|$. Its normalizer is \[ N_G(P)=\{g\in G:gPg^{-1}=P\}. \] The subgroup $P$ is self-normalizing if $N_G(P)=P$. Let $\operatorname{Irr}(G)$ denote the set of irreducible complex characters of $G$, and put \[ \operatorname{Irr}_{2'}(G)=\{\chi\in\operatorname{Irr}(G):2\nmid\chi(1)\}. \] The McKay conjecture at the prime $2$ is the assertion that \[ \left|\operatorname{Irr}_{2'}(G)\right| = \left|\operatorname{Irr}_{2'}(N_G(P))\right| \] for every finite group $G$ and every $P\in\operatorname{Syl}_2(G)$. In the self-normalizing case, the assertion to be reduced is therefore \[ \text{for every finite }G\text{ and every }P\in\operatorname{Syl}_2(G),\qquad N_G(P)=P\ \Longrightarrow\ \left|\operatorname{Irr}_{2'}(G)\right| = \left|\operatorname{Irr}_{2'}(P)\right|. \] A finite group $H$ is almost simple if there is a finite nonabelian simple group $S$ such that \[ S\leq H\leq\operatorname{Aut}(S), \] where $S$ is identified with its group of inner automorphisms.

The supplied question asks whether the McKay conjecture for finite groups with self-normalizing Sylow $2$-subgroups can be directly reduced to almost simple groups. The displayed universally quantified assertion identifies the target of such a reduction; it does not specify the reduction hypotheses. In particular, the record does not say which almost simple groups are to be considered, whether their Sylow $2$-subgroups must also be self-normalizing, or what additional conditions constitute a direct reduction. The supplied dated assessment reports that the underlying sentence is incomplete. Consequently, a precise reduction theorem cannot be recovered from this record without further source clarification.

Short English statement

The question asks whether the McKay equality counting irreducible complex characters of odd degree, for every finite group with a self-normalizing Sylow $2$-subgroup, can be established by a direct reduction to almost simple groups. The intended reduction and its hypotheses are missing. The supplied open label is dated curation, and this statement-only draft requires human mathematical review.

Sources

  • Local UnsolvedMath registry, permanent ID $30002850$, source problem code catalogue entry, title: Direct McKay Reduction for Self-Normalizing Sylow Two-Subgroups. The record belongs to the Oberwolfach Reports Open Problems collection and gives the proposed year as $2015$; no proposer is named.
  • Supplied report citation: Representations of Finite Groups (2016), Oberwolfach Reports, pp. 971--1027, DOI 10.4171/owr/2015/18. Supplied source URL and literature source labelled "original OWR report": https://doi.org/10.4171/owr/2015/18. The collection describes these reports as records of mathematical workshops and their open-problem discussions. This citation has not been independently consulted here.
  • Literature assessment dated 2026-08-21: the supplied status is open, but the assessment says that the sentence ends before stating the proposed direct reduction, leaving the exact claim incomplete and unverifiable. This is supplied dated curation, not an independently verified literature assessment. The record explicitly calls for independent verification of time-sensitive status and cited claims.
  • The registry also labels the statement "exact" and describes it as clear, self-contained, publication-ready, and retained byte-for-byte. These supplied verification claims conflict with the supplied assessment of incompleteness and do not establish the missing reduction statement.

Catalogue entry

Statement licence: CC-BY-SA-4.0 · Source file

Contributions 0

No attempts yet. Significant partial results and substantial reductions are welcome. Contribute an attempt.