On a dual version of Huppert’s <i>ρ</i> - <i>σ</i> conjecture of codegrees (Q6919100)

Let \(G\) be a finite solvable group and \(\chi \in \operatorname{Irr}(G)\) be an irreducible complex character of \(G\). As usual, the author defines\N\[\N\operatorname{codeg}(\chi)=\frac{|G: \ker \chi |}{\chi(1)} \quad \mbox{ and } \quad \operatorname{codeg}(G)= \left\{\operatorname{codeg}(\chi) \mid \chi \in \operatorname{Irr}(G) \right\}.\N\]\NLet \(p \in \pi(G)\) be a prime and let \(\operatorname{codeg}_{p}(G)\) be the set of character codegrees of \(G\) that are divisible by \(p\). The main results are as follows.\N\NTheorem 1.1: If \(O_{p'}(G)=1\), then \(\operatorname{dl}(G/O_{p}(G)) \leq 2 \log_{2} \log_{2} (|\operatorname{codeg}_{p}(G)|+1)+ \frac{68}{7}\).\N\NLet \(k\) be a positive integer such that any prime \(p\) divides at most \(k\) members of \(\operatorname{codeg}(G)\) and let\N\[\N\Pi=(\log_{2} k + 1) \cdot \big [2 \log_{2} \log_{2}(k + 1) + \tfrac{75}{7} \big ].\N\]\NTheorems 1.2 and 1.3 state respectively that \(| \pi(G) | \leq \Pi\) and \(| \operatorname{codeg}(G) | \leq k \cdot \Pi +1\).\N\NThe clarity of the results and the paper's overall appeal would be improved by adding suitable examples.