Projective character degree patterns of 2-groups (Q4947074)

Let \(G\) be a finite group and \(\text{Proj}(G,\alpha)\) the set of all irreducible projective (complex) characters of \(G\) with \(2\)-cocycle \(\alpha\). If \(G\) is a \(p\)-group, then a sequence \((x_0,x_1,x_2,\dots)\) of non-negative integers such that \(\sum_{i=0}^\infty x_ip^{2i}=|G|\) is called a possible projective character degree pattern for \(G\). \(G\) is said to realize the projective character degree pattern if there exists a \(2\)-cocycle \(\alpha\) such that \(\text{Proj}(G,\alpha)\) contains exactly \(x_i\) elements of degree \(p^i\) for all \(i\). The authors investigate \(p\)-groups which realize their possible projective character degree patterns with \(x_0=0\). The case \(p=2\) appears to be more difficult, and the authors completely classify all \(2\)-groups which realize all their possible projective character degree patterns with \(x_0=0\).