Character Nonvanishing under Coprime Actions

summary

The gist

Let A finite group act coprimely on a finite group G and put C = CG(A).

In short

The paper investigates whether a character vanishing nowhere on a subgroup C is determined solely by its Glauberman–Isaacs correspondent, as posed by Problem 21.100. It provides a counterexample where this fails: for specific coprime actions of group A on G, the number of characters nonvanishing on C is less than the predicted size |C/C'|. This shows that the correspondence between characters and their correspondents does not always guarantee nonvanishing.

Key concepts

Coprime Action
This describes a situation where two groups, A and G, interact in a special way: they act on each other without sharing any common prime factors. This setup is used to study how characters of the larger group G behave when restricted to subgroups related to A.
Character Vanishing Nowhere
This refers to irreducible characters ($\chi$) of a group G that do not have a zero value at any element in the subgroup C = CG(A). The classical Burnside theorem suggests these characters should only be linear, but this paper tests if this holds under coprime actions.
Glauberman–Isaacs Correspondent
This is a specific mapping between certain irreducible characters of G and those of a subgroup A. The paper explores the hypothesis that $\chi$ does not vanish on C if and only if its correspondent character $\chi^*$ is linear, which is the core question being tested.

Terminology used across episodes

This episode discusses

The paper

Character Nonvanishing under Coprime Actions · Read on arXiv

Eric Hou

Let a finite group A act coprimely on a finite group G, and let C=C G(A). Navarro asked whether an A-invariant irreducible character has linear Glauberman--Isaacs correspondent if and only if it is nonvanishing on C. We give counterexamples to this equivalence. We also prove that when G is nilpotent, nonvanishing on C implies that the Glauberman--Isaacs correspondent is linear.

Transcript

Introduction to the show: ident: Mathematics. The day in mathematics: new theorems, new proofs, and what they open.

Ada: We're looking at the paper: "Character Nonvanishing under Coprime Actions".

Emmy: Here's the gist of the paper. Let A finite group act coprimely on a finite group G and put C = CG(A).

Ada: A classical theorem of Burnside asserts that the irreducible characters of a group vanishing nowhere are exactly the linear ones, and Navarro asked in Problem 21.100 of the 21st Kourovka Notebook whether the coprime analogue holds: is the number of A-invariant χ ∈ Irr(G) with χC nowhere zero always C/C′?

Emmy: This would follow if one could show that χC is never zero if and only if the Glauberman–Isaacs correspondent χ∗ of χ is linear The Counterexample Construction Theorem A states that there exist a finite group A ∼= C21 and a finite 2-group G of order 2135, with A acting faithfully and coprimely on G, such that NA(G) = 1728 and CG(A)/CG(A)′ = 4096 In particular the equality of Problem 21.100 fails The group is G = B ⋊ V, where V = F24 ⊕ F8 and B is the group of Boolean functions on V, and B is the additive group of all Boolean functions on V The Mechanism of Failure The strategy for proving Theorem A involves isolating a counterexample where three facts do all the work First, C = CG(A) = BA is elementary abelian of rank the number of A-orbits on V (Proposition 2.2) Second, the little-groups method identifies IrrA(G) with BA (Proposition 2.5), so that IrrA(G) = C/C′ exactly; hence a single invariant character with a zero on C already refutes Problem 21.100 Third, if u = δ0 ∈ BA is the indicator of 0 ∈ V, the associated χu ∈ IrrA(G) has degree V and satisfies χu(c) = V − 2supp c for c ∈ BA (Lemma 2.10) Everything therefore reduces to an arithmetic question about the multiset of A-orbit sizes on V: does some sub-multiset sum to V/2 The Arithmetic Constraint The condition for a character vanishing at some element of C is determined by Corollary 2.9, which states that if some χ ∈ IrrA(G) vanishes at some element of C, then some sub-multiset of the A-orbit sizes on V sums to V/2 The smallest admissible cyclic pair is A = 21 with dim V = 7, where the orbit sizes are forced to be 1, 3, 3, 3, 3, 3, 7, and the sub-multisets summing to V/2 are exactly the twenty of the forms The Final Count Theorem A concludes that for this action there is a χ ∈ IrrA(G) of degree 128 and a c ∈ C with χ(c) = 0 This implies NA(G) ≤ 4095 < 4096 = C/C′, and the equality of Problem 21.100 fails The exact count is given by Theorem 7.1, showing that NA(G) = 1728 and CG(A)/CG(A)′ = 4096 Consequences for Related Problems Corollary B shows that the proposed criterion of Problem 6.3 fails because there are 2368 characters χ ∈ IrrA(G) with χ∗(1) = 1 for which χC nevertheless has a zero Corollary D demonstrates that this failure persists when passing to direct powers, as the ratio NA(Gn)/Cn/(Cn)' approaches 0 as n → ∞ The smallest dimension for a balanced pair (A, V) is 7 The Exact Verification Verification confirms that three programs compute NA(G) by different routes—a 128-point integer Walsh transform, a direct computation in F24 ⊕ F8 from the radial correlation table, and a binary linear-algebra test built on the twenty zero patterns of Lemma 6.1—and all three return 1728 The final script confirms that K = C × A is a Carter subgroup of Γ, as Proposition 9.1 asserts The Minimal Case Remark 3.7 notes that the smallest balanced pair (A, V) has dim V = 8 with A = 15 and element orders This confirms that the construction of Section 4 produces a counterexample to Problem 21.100 if and only if V has an A-stable subset of size V/2 The smallest order of a balanced operator group is A = 15, attained at dim V = 8 The General Principle The paper establishes that nonvanishing on C is not determined by χ∗ alone, and that any repair of Problem 6.3 must either restrict the operator group — to a p-group, say — or use more of χ than its correspondent The p-group case is the one that survives, and it is the natural remaining question The Exact Zero Criterion Lemma 6.1 states that expression (10) vanishes if and only if (H0, H1) = (δ + εJ, ρR + εJ) for some ε ∈ F2 and some three-element subset R ⊆ This corresponds bijectively to the twenty A-stable subsets of V of size 64 found in Proposition 3.3 The final count is NA(G) = 1728 and CG(A)/CG(A)′ = 4096 The Carter Subgroup Analogue Theorem 9.4 shows that the number of characters of Γ that do not vanish at any element of K is 21 NA(G) = 36288, whereas K/K′ = 86016 This proves Problem 6.7 of

12: has a negative answer The head characters of Γ are not the Carter-nonvanishing irreducible characters of Γ The General Bound Theorem 9.7 shows that there are at most A NA(G) such characters, and since NA(G) 36288 This proves Problem 6.7 has a negative answer for Γ, and the head characters of Γ are not its Carternonvanishing characters The smallest we obtain is the one of Theorem 9.4, of order 2135 · 21 The Inequality The inequality NA(G) ≤ C/C′ always holds in our examples, and holds trivially whenever C is abelian, since then C/C′ = Irr(C) = IrrA(G) ≥ NA(G) We know of no general argument The Repair The paper suggests that a repair of Problem 6.3 must either restrict the operator group — to a p-group, say — or use more of χ than its correspondent The p-group case is the one that survives, and it is the natural remaining question The Verification Verification confirms that three programs compute NA(G) by different routes—a 128-point integer Walsh transform, a direct computation in F24 ⊕ F8 from the radial correlation table, and a binary linear-algebra test built on the twenty zero patterns of Lemma 6.1—and all three return 1728 The final script confirms that K = C × A is a Carter subgroup of Γ, as Proposition 9.1 asserts The smallest we obtain is the one of Theorem 3.5 and Corollary 3.6, which shows that dim V = 7 is the least attainable dimension in which the construction of Section 2 produces a counterexample, over all operator groups of odd order The smallest order of a balanced operator group is A = 15, attained at dim V = 8 The paper is 30 Jul 2026 The Scope Problem 6.3 sits inside a group of related problems in

12: , and Navarro raises it there as an instance of a general principle: for a distinguished subgroup H ≤ G and a natural bijection ∗ from a canonical subset of Irr(G) onto one of Irr(H), one expects χ∗ to be linear exactly when χH is never zero Corollary B refutes that principle for the Glauberman–Isaacs correspondence The hypothesis that A be a p-group cannot be dropped The Verification The proofs above are self-contained; the computations described here are independent checks and are used nowhere in them All of them are exact, in integer and F2 arithmetic with no floating point, and all are available in

5: The paper is arXiv:2609.16227v1

math.GR: 30 Jul 2026 The author used OpenAI’s ChatGPT (GPT-5.6 Thinking) during the preparation of this manuscript for mathematical exploration, checking intermediate arguments and edge cases, generating exact verification code, and editorial revision The author reviewed the resulting arguments and takes responsibility for the contents of the paper The acknowledgments thank Abhinav Namboori for helpful discussions and comments on the exposition The References The references include

1: A.

Ada: H.

Title and authors: Ada: Let's start with the title and who wrote this paper, "Character Nonvanishing under Coprime Actions." It sounds very specific, focusing on characters not vanishing on the fixed subgroup C when A acts coprimely on G.

Emmy: The authors are Eric Hou, and they're working with a situation where A acts faithfully and coprimely on a two-group G of order two thousand one hundred thirty-five <ref:2609.16227#pg1>.

Kolya: That specific setup is interesting because it sets up the counterexample they need to show the conjecture fails.

Ada: The authors are setting up a situation where they find that this identification between nonvanishing characters and linear characters of C doesn't always hold, which refutes what Isaacs suggested.

Emmy: It's a crucial distinction because it suggests that the correspondence isn't perfect in all cases, even for solvable A groups.

The paper's summary: Ada: So, let's move to the summary of "Character Nonvanishing under Coprime Actions." The paper describes a group A of order twenty-one acting on G, where G is a specific type of group called B direct product V <ref:2609.16227#pg1,of order 21 acting on G>.

Emmy: This setup involves C being an elementary abelian group whose rank is determined by the number of orbits A has on V, and they use the little-groups method to link characters in Irr A(G) to characters in C.

Kolya: The core mechanism they use is showing that if a character vanishes somewhere on C, it forces some specific sub-multiset of the sizes of those orbits on V to sum up to exactly half of V.

Ada: That arithmetic constraint about summing to half the size of V is what they use to find the counterexample. They prove that this condition can only be met if V has an A-stable subset whose size is exactly half of V, and they show this happens for infinitely many pairs (A, V) but never for dimension less than seven.

Emmy: So, the summary boils down to finding a specific configuration where some character vanishes because of this geometric constraint on the orbits.

The paper's improvements: Ada: The authors suggest that their proof isolates a very short counterexample in Section four, which they claim can be checked by hand. This makes the construction quite concrete for verification.

Emmy: They break down the proof into three facts that work together: first, C is elementary abelian of rank equal to the number of A orbits on V; second, the little-groups method connects Irr A(G) to B direct product V; and third, they use a specific character associated with the indicator function of zero in V.

Kolya: The improvement here is really showing that this entire problem reduces to an arithmetic question about those orbit sizes summing up to half of V. That's a very clean way to frame the failure.

Ada: And for someone just listening, it means that if you can find an action where you can control the orbits on V, you can force a character to vanish by choosing A and V correctly.

Conclusion: Emmy: To wrap up, the paper concludes that for their specific group action—the C21 acting on G of order two thousand one hundred thirty-five—there is a character in Irr A(G) with degree one hundred twenty-eight that vanishes at some element of C.

Ada: That means the number of characters nowhere zero on C is one thousand seven hundred twenty-eight which is smaller than the size C/C Prime which they calculated to be four thousand ninety-six proving the equality fails for this case <ref:2609.16227#pg1>.

Kolya: From a probabilistic view, it suggests that as you increase the dimension of V or use larger groups A, this failure becomes even more pronounced because of how fast those ratios approach zero when you look at direct powers.

Ada: So, to summarize "Character Nonvanishing under Coprime Actions," they show that the expected correspondence between nonvanishing characters and linear characters is not always true.

Emmy: It confirms that for a general group A acting coprimely on G, we can't just rely on the Glauberman Isaacs correspondent to know if a character vanishes somewhere.

More episodes

← Home