WorksMathematics
The Exact Central-Index Profile of Groups with Bounded Noncommutativity
Abstract
For a finite group , let be the largest size of a pairwise noncommuting set and put . We determine the maximum possible central index under for every integer , giving an exact answer to Neumann's central-index question and sharpening Pyber's exponential upper bound. The maximum is for , for , for , and for . In the last range, with , equality holds exactly when and . We also obtain the sharp universal bound . All maximizers are classified up to isoclinism. The results extend to arbitrary groups with finite clique number through finite isoclinic representatives.
Introduction
The size of a pairwise noncommuting set measures how many elements of a group can be mutually incompatible with commutativity. For a finite group , let be the largest size of such a set. We ask how strongly a bound on constrains the index of the centre. The order of itself cannot be bounded in this way: taking a direct product with an arbitrarily large abelian group changes neither nor the central index. The natural extremal quantities are therefore
Here the supremum is over finite groups. In graph-theoretic language, join two elements of when they do not commute; then is the clique number of this noncommuting graph. Thus the problem relates a combinatorial restriction to a structural invariant of the group.
The origin is a question posed by Erdős in 1975: if a group has no infinite pairwise noncommuting subset, must the sizes of its finite pairwise noncommuting subsets be bounded? Neumann answered this affirmatively in 1976 by proving the stronger statement that such a group has finite central quotient [20 Theorem 6]. We first solve the finite extremal problem and then extend the sharp bounds to arbitrary groups by isoclinism, as explained in Corollary 1.4 below. Neumann also explicitly asked how the central index can be bounded in terms of the largest noncommuting set. His proof gave , and he suggested a possible quadratic bound for itself [20 Section 4].
Pyber resolved the scale of this quantitative question in 1987: there is an absolute constant such that for every finite group [21]. In particular, is finite. The extraspecial -groups show that exponential growth is necessary; their precise parameters are recalled below.
The remaining extremal questions are to determine the optimal exponential base, the exact maximum at each finite cap, and the groups attaining it. These are distinct from the related questions about large abelian subgroups and the number of commuting tuples studied by Erdős and Straus [12].
Several parts of the literature supply information about the models and local estimates relevant to these questions. Isaacs’s formula, reported by Bertram, gives the clique numbers of extraspecial 2-groups [5 p. 40]; Chin studies noncommuting sets in extraspecial -groups [10]. Further results treat groups with derived subgroup of prime order and metacyclic -groups [18, 14]. For scalar commutator maps, noncommuting sets correspond to sets of pairwise nonorthogonal points in symplectic geometry. Results on partial ovoids therefore provide sharp information in some small odd-characteristic cases [7, 9]. Covering theorems provide a complementary tool: the centralizers of the elements of a maximum clique cover the group, so bounds for subgroup and coset covers can control the central index [19, 22, 8].
The present article determines and classifies all its maximizers up to isoclinism for every . The eventual extremizers are precisely the extraspecial binary isoclinism classes, but small parameters also require quinary and ternary models. The proof combines the geometry of the nilpotent cases with a centralizer descent that excludes larger values in arbitrary finite groups. We first state the exact profile, then describe its models, its extension to arbitrary groups, and the structure of the proof.
Theorem 1.1 (The central-index profile). For every integer , the supremum defining is attained and equals
The three nontrivial ranges have different extremal models. In the Heisenberg group , the commutator on the central quotient is the determinant. Pairwise noncommuting elements project to distinct lines, and one may choose one representative of every line. Consequently
Taking explains the four initial squares. An extraspecial 3-group of order instead has and . Its cliques are partial ovoids of , that is, sets of pairwise nonorthogonal projective points: Tallini’s bound for odd gives the upper bound seven, and two symplectic planes give the matching construction [9 Section 2 and Table 1]; see also [7, 11]. Finally, for an extraspecial 2-group of order , Isaacs’s clique formula, reported by Bertram [5 p. 40], gives
Thus the largest allowed gives and explains the paired plateaux. These examples prove all lower bounds in Theorem 1.1.
Theorem 1.2 (All extremizers). Let be finite with .
If or , then is abelian and .
If and , then if and only if and ; such groups have and are isoclinic to an extraspecial group of order .
If , then if and only if is isoclinic to either an extraspecial group of order or . These are two distinct isoclinism classes, and both have .
(iv) If or , then if and only if and ; such groups have .
(v) If and , then if and only if and ; such groups have .
In (iv) and (v), the groups form the corresponding extraspecial isoclinism class. Thus all maximizers are identified up to isoclinism for every cap .
Corollary 1.3 (Sharp exponential bound). Every finite group satisfies
Equality holds precisely when and . Moreover,
Corollary 1.4 (Arbitrary groups). Let be a group, not necessarily finite, with . Then , and all the equality characterizations in Theorem 1.2 remain valid. The sharp bound and its equality case in Corollary 1.3 also remain valid when . For every , the bound is attained by both finite and infinite groups.
Proof. The abelian case is immediate. Otherwise, Zarrin’s finite-representative theorem [23 Theorem 1.1(2)] gives a finite group isoclinic to , with . Isoclinism also gives and . Thus , and the finite results give every asserted bound and equality characterization. Taking the direct product of a finite maximizer with an infinite abelian group preserves both invariants and proves the last assertion. □
Underlying this established reduction are the finiteness of the central quotient, Schur’s theorem, and Hall’s existence of a stem representative , meaning that [17]. Isoclinism preserves the commutator map and hence the clique number [23 Lemma 2.1 and proof of Theorem 1.1]. In particular, the equality statements specify an isoclinism class; they do not assert a direct-product decomposition of an infinite extremizer.
Proof strategy. The proof separates the nilpotent structure from the passage to a general group. § 2 develops one calculus for both: cliques in cosets and commuting products. § 3 proves the Sylow budgets, the complete nilpotent profile and the binary rigidity theorem.
For a centralizer , the accounting identity is
§ 4 introduces the prime cost of losing centrality and then uses Baer–Suzuki to choose a nonnilpotent , whose central quotient amplifies cliques of four times. Two saturation principles close the finite exceptions: near-minimal ternary losses force divisibility, and affine conjugacy classes force a faithful action on the class.
§ 5 first settles the finite caps and then begins one induction at eighteen. A numerical prime-cost bound pays for the internal centralizer index with the same budget as the central loss. This leaves one centralizer estimate, a finite list of saturation obstructions and one envelope for all larger caps. The extremizer statements then follow from the nilpotent rigidity already proved, and the sharp exponential estimate follows from the exact profile.
Notation. Groups in the proof of the finite results are finite; Corollary 1.4 explicitly removes that hypothesis. For an arbitrary group, denotes the supremum of the cardinalities of pairwise noncommuting subsets; whenever it is finite, it is a maximum. We write for the derived subgroup and for the pointwise centralizer of a subset , with . We use and . A clique is a pairwise noncommuting set; maximum means of largest cardinality. We also use for a subset or a coset. Two sets are completely adjacent if every element of one fails to commute with every element of the other. An abelian group has clique number one, and no group has clique number two: a noncommuting pair extends to the clique . The integer is an upper cap; for a fixed ambient group , write and . Logarithms are binary unless specified. denotes the cyclic group of order and the field with elements. We write for the symplectic polar space associated with . For a finite abelian or nilpotent group , the symbol denotes its Sylow -subgroup. We use for the lower central series and for the sharp constant above. Isoclinism means an identification of the central quotients and derived groups compatible with their commutator maps; it does not require a direct-product decomposition with an extraspecial factor.
Clique constructions
We use three ways to construct cliques: inside a coset, by adjoining an element that moves a central subgroup, and across commuting factors. Only the coset estimate requires a covering argument.
Cliques in a coset
A coset cover is irredundant if none of its members can be deleted. A maximum clique in a coset will produce such a cover by centralizers; the next estimate turns that cover into a lower bound for the clique. For its context see [19, 22, 8, 4]; the binary vector-space case is also covered by [6].
Lemma 2.1 (Coset-covering bound for a -group). Let be a finite -group and an irredundant covering by right cosets of subgroups. Then
Proof. We induct on , the case being immediate. For all are proper. Choose a maximal subgroup ; it is normal of index . Translate the cover so that , and choose an irredundant subcover of with indices . Put and . Induction gives .
Suppose the subgroup intersection for the selected indices is . Their cosets form a proper subfamily of the original irredundant cover, so choose outside their union. The coset avoids them all. Intersect the remaining cosets with and translate by ; their nonempty intersections are right cosets in , with directions . An irredundant subcover selects new indices and gives
Induction applies since . The nonempty index sets are disjoint, so this process reaches after finitely many steps, even if some successive subgroups coincide. Since ,
For the last inequality, gives ; if , use . No subgroup direction is assumed normal.
Lemma 2.2 (Coset calculus). Let , , and let be a maximum clique in . Then
The sets , , form an irredundant coset cover, and some satisfies . If is a -group, then
If is abelian, the exact formula is
If is a nonabelian -group, then .
Proof. The right-hand side of the first identity centralizes all of . Conversely, suppose centralizes but not some . Multiply by precisely the vertices of commuting with . Mutual noncommutation is preserved, and the new clique extends by , a contradiction. This proves the identity.
Maximality makes the displayed sets cover , and each belongs only to its own set, so the cover is irredundant. The part at is and has size ; counting gives the averaging assertion. Translation by identifies the parts with left cosets in . Inversion turns them into right cosets with the same subgroup directions. The intersection of those directions is , so Lemma 2.1 proves (4). Finally, when is abelian, and commute exactly when , proving (5).
For a nonabelian -group, a one-part cover would force . Otherwise every direction is proper and each part has size at most . At most parts could cover only by partitioning into index- cosets. Their directions are normal, and cosets of distinct index- subgroups intersect, so all directions coincide. Their intersection lies in , making cyclic, a contradiction.
Lemma 2.3 (Clique extensions). If and , then
If , then
Proof. The abelian-coset formula gives vertices in . Choose . In a maximum clique of , multiply by precisely the vertices commuting with . Their mutual commutators are preserved, and every resulting vertex is noncommuting with every element of . This proves (6).
For (7), multiply a maximum clique of by lifts of a clique in . Cross commutators from lie outside , whereas , so they cannot cancel commutators from . Products using the same lift remain noncommuting inside .
Lemma 2.4 (Small central quotients). If is nonabelian and , then is , , or . Thus for , and for .
Proof. For , twisting on gives . Every proper centralizer is therefore abelian. Their noncentral parts partition , and their number is . Write their orders modulo as and put . Then
so . For all orders are two, giving . For , the conditions leave only or , giving or nine. A cyclic central quotient is impossible; the listed isomorphism types follow.
The nilpotent profile and rigidity
The common coset calculus controls every Sylow subgroup through a scalar commutator form and the cliques in its fibres. We prove the prime budgets first, combine them into the nilpotent profile, and then establish the binary gap that will classify the maximizers. We use the elementary fact that if is a -group, lifting its central series makes nilpotent and all Sylow subgroups at other primes central.
The symplectic model
For a symplectic form , a clique means a set whose distinct vectors have nonzero -pairing. Such sets model noncommuting elements [5, 10, 18]. The hyperplane variant below will also be used in the equality proof.
Lemma 3.1 (Symplectic cliques). Let be symplectic of dimension over . There is a clique of size , and one can choose such a clique to meet any prescribed hyperplane in exactly one point. Every maximum clique spans . For , the maximum is exactly , and every maximum clique has sum zero. For , a clique of size at least exists.
Proof. In a symplectic plane, choose one representative of each of its lines. If are cliques in orthogonal summands and , then is a clique of size . This proves the lower bound . For the hyperplane assertion write , choose , and split . For a clique of size , using when , the set
is a clique of size , and only belongs to .
If a maximum clique does not span, choose and with . Translate by precisely the vertices of orthogonal to . All mutual pairings are unchanged, and the resulting clique extends by , a contradiction.
Over , a clique of size has Gram matrix , where has all entries one and is the identity matrix. The Gram matrix has rank for even and for odd . Hence , with equality by the construction above. The sum of a maximum clique is orthogonal to each of its vertices; as these span, the sum is zero. For , [9 Theorem 3.7] supplies a partial ovoid of of size . Choosing one nonzero vector on each projective point gives thirteen vertices in dimension six. For , , orthogonal gluing with planes gives vertices.
The next lemma enlarges cliques when a scalar form hides a second commutator coordinate. It will be used in the small ternary case and in the binary rigidity proof.
Lemma 3.2 (Affine inflation of a nonscalar form). Let be alternating bilinear over , with values spanning , and . If some scalarization is nondegenerate, then and
where is the largest size of a set with pairwise nonzero -values.
Proof. Choose independent of and put . Define by . Since the values of span , is not scalar. Hence some are linearly independent: an operator preserving every line is scalar, as a basis and its pairwise sums show. On the functional is therefore nonzero and descends to . This space is symplectic of dimension , so .
By Lemma 3.1, has a scalar clique of size meeting the kernel hyperplane once. Lift its vertices to , with exceptional. Replace each , , by the affine line . Within a line, distinct vectors have nonzero -pairing because . Between different lines, and with , the -pairings remain the nonzero quotient pairings. The resulting clique has vertices.
Scalar fibres and Sylow budgets
Scalarization applies a homomorphism with values in to the commutator. A nonzero scalar value certifies noncommutation, but a zero value need not certify commutation. The radical consists of those elements invisible to the chosen scalar form; we must therefore count cliques inside its cosets as well as between them.
Let be a nonabelian -group. A nonzero homomorphism exists by nilpotence. We also write for its composite with . The pairing
is biadditive and conjugation-invariant. Its radical is
It is normal and contains . The induced form on is nondegenerate, making an elementary abelian symplectic space. All scalarizations below use a nonzero . We use the parameters
Since is normal in , its centre is normal and abelian. The identity separates the scalar quotient from two parts hidden in its radical: noncommutativity inside , measured by , and the excess of over , measured by . The term records the action of on . Here or , since a nontrivial central quotient is not cyclic, and is the subgroup generated by the commutators. We call a coset a scalar fibre. Fibres above distinct vertices of a scalar clique are completely noncommuting with one another, so their internal clique sizes can be added.
The odd-prime estimates apply in every nilpotency class; compare the restricted families in [2, 14, 18].
Theorem 3.3 (Sylow budgets). Let be a finite -group, and put . For nonabelian , use the scalarization parameters in (3.1).
(i) If , every scalarization of nonabelian satisfies
For nonabelian , equality forces to have class two and to be elementary abelian of even dimension. Every -group consequently satisfies
(ii) For odd ,
In particular, for , and for .
(iii) If and , then . If , and , then , and .
Proof. The abelian case is immediate, so assume nonabelian. The common fibre estimate below is the input for all three parts. The binary case uses a relation between the conjugation actions; the odd cases use lower bounds for the sizes of the fibres.
Common fibre estimate. Choose lifts of a spanning scalar clique and put . The coset bounds give and . Distinct fibres above are completely adjacent. Since is normal and abelian, and for . Thus the maps are homomorphisms, with common kernel , because the lifts and generate and centralizes . Their joint image has order and embeds in the product of their images, of orders . Hence
Part (i): binary interaction. For , choose a zero-sum scalar clique of size and lift it to ; put . Their actions on commute, since centralizes , and because . Write additively and put and , with . The maps
satisfy and by telescoping. Each is invariant under all , so . Counting gives
Substitution in (12) yields . If , then , so . Thus is elementary abelian of even dimension and . In general ; when is odd, equality is impossible, so . This proves (10).
Part (ii): odd-prime budgets. Let be odd and set , so or . Choose maximum, hence spanning. Its size is at least ; for it is at least , and is four when . For integers , put . Then
The first inequality averages the two arguments of the maximum, using . For the second, check directly; for , use the same averaging with . Together with (12), these give, for ,
For , they give
These prove (11). For , gives . For and ,
When , the scalar-plane clique gives , hence ratio at most . When , necessarily , so and the ratio is at most . The case is impossible because a nontrivial central quotient cannot be cyclic. This completes (ii).
Part (iii): the small ternary gap. Suppose , and . Choose one nonzero representative of each of the four lines of . If is nonabelian, the nonabelian-coset bound gives four vertices in each of the four completely adjacent fibres, hence sixteen. If is abelian, the action of on is nontrivial. Its kernel is a proper subspace containing at most one of our four representatives. Each of the other three cosets has a clique of size at least three; the fourth has at least one. Thus in either case.
At central index every nonzero scalarization has rank two and a noncentral radical, proving the first assertion of (iii). At index with , the same argument excludes scalar radicals of index nine. Hence every scalar radical is the centre, and has class two with . Also is elementary abelian, since . If its dimension were at least two, Lemma 3.2, with and , would give ten vertices. Thus the commutator is a nondegenerate scalar form; its clique number is seven by the calculation recalled in § 1. This proves (iii). □
Combining the Sylow budgets
Proposition 3.4 (The full nilpotent profile). If is nilpotent and , then . Every value is attained by a nilpotent group. For , the comparison with is strict if an odd-order Sylow subgroup of is nonabelian.
Proof. The abelian case is immediate. Write and put . Cartesian products of cliques give . The Sylow budgets give
where the factor is needed only in the ternary part.
First let or , with . If exactly one Sylow subgroup is nonabelian, put for its prime . The binary bound gives when . For , the odd budget gives , and . For ,
For , gives for ; for , the respective bounds finish the comparison. If at least two Sylow subgroups are nonabelian, their clique numbers are at least three and one is at least four. Hence
The small quotients in Lemma 2.4 handle . For , at most one Sylow subgroup is nonabelian, since two would already supply at least twelve vertices. The binary bound gives respectively . For , the odd budget leaves central exponents at most ; exponent three is excluded by Theorem 3.3(iii). The resulting ternary maxima are . For a nonabelian Sylow subgroup with , the inequalities and leave at , and at only for the cap eight. Thus the maxima at are . The cap seven follows from eight and the ternary example. The models of § 1 attain every bound. □
Binary rigidity
The numerical profile leaves one extra vertex at even binary caps. The next theorem rules it out unless the commutator form is scalar. Its proof uses only the bounds already established.
Theorem 3.5 (Uniform rigidity at a binary-square index). Let be finite and suppose , where is even and . Exactly one of the following holds:
In particular is impossible.
Proof. Every odd-order element lies in , so with a 2-group and central of odd order. Thus we may replace by . Suppose . We first show that every scalar radical is ; affine inflation will then force the derived group to have order two. For any scalar radical , the interaction bound gives , hence and .
Excluding a noncentral radical. If , then is abelian and has order two, hence is central. For , the identity gives . Thus the pairing
is bilinear with trivial left radical, so . The right radical of this pairing is a proper subspace of . Choose a hyperplane containing it and a scalar clique of size meeting that hyperplane once. Each of the other vertices acts nontrivially on , so its fibre contains at least two noncommuting elements. The remaining fibre contributes one, giving . If , this is at least . Since and both are even, the remaining case is , making the pairing perfect and , .
Choose a symplectic clique in and . Let consist of two copies of each and one copy of , and lift them to . The perfect pairing realizes every by with . Moreover implies : for , the map is a homomorphism to the centre and therefore kills . Hence
Nonzero scalar pairings remain nontrivial because and is the scalar radical, so . For every zero scalar pairing whose commutator lies in , prescribe its correction exponent to make the displayed commutator equal to ; prescribe zero on the other zero pairings. To meet the prescriptions, denote the functionals for the two copies of by , and set the functional for equal to zero. Distinct doubled families have scalar pairing one, so there is no constraint between them. Within the th family the only constraint is
where is the prescribed correction for its repeated pair. If , the two additional constraints are for , where are the prescribed corrections for the pairs with . If , there is no constraint on these values. Choose and . Since and are linearly independent, each choice of the required values on these two vectors extends to a functional on . The choices for distinct families are independent, so all prescriptions hold simultaneously. The corrected lifts therefore form a clique of size , again a contradiction.
Identifying the commutator form. Thus every scalar radical is . Since it contains , the group has class two and elementary abelian central quotient; is also elementary abelian. If , Lemma 3.2 gives . Consequently , and its nondegenerate symplectic form gives . The two alternatives are exclusive, as claimed. □
Remark 3.6 (The dimension threshold). The restriction is necessary: has , and . Indeed, its commutator is the determinant of the two coordinates in , so a maximum clique has one representative from each of the five points of . Thus the scalar dichotomy fails when .
Centralizer reduction and saturation
The nilpotent case is settled. To control a general group, we must bound a centralizer index and the centrality lost outside that subgroup. We first quantify the loss, then select the centralizer and obtain the numerical bound used later. Two saturation principles will exclude the finite cases left by that bound.
Charging a loss of centrality
For and , the index measures how much of is central in but not in . Adjoining generators from up to removes this excess. At each nontrivial step, Lemma 2.3 forces new clique vertices. No normality of in is required.
For a positive integer , let be the exponent of in . Define the additive prime cost and, for integers , its product envelope by
Since , the envelope satisfies for . Splitting a composite factor never increases its additive cost, since for . Thus is the minimum sum of nontrivial factors with product . Integer break gives and, for , the usual product of 2’s and 3’s: if , if , and if .
Theorem 4.1 (Central-loss calculus). Let , and put . Then
More explicitly, for , put , , for , and for . Then
For distinct primes , one moreover has
If , this lower bound improves to twelve. No normality of in is assumed.
Proof. Since , twisting adds at least vertices at each nontrivial step. Sum these increases and use . Splitting the factors into primes proves (14).
For the surcharge choose outside the union of the two proper subgroups and . Then is divisible by . Twisting first by and applying the ordinary cost to the remaining loss gives . Splitting while retaining as one factor gives , proving (16). When , the first mixed index is 6, 12, 18 or 36. Only six could cost less than twelve; it leaves a loss six, whose mixed surcharge costs six more. ∎
Every central loss with available budget satisfies
We set for . At budgets , the mixed surcharge sharpens this to , respectively: mixed losses have , while the largest pure prime powers of cost at most are .
For later use, put , , and . Then
Indeed : a central element of centralizes and hence belongs to . Apply (7) and the central-loss bound with , .
Fourfold centralizer selection
Lemma 4.2 (Complement rigidity). If is an integer, and , then either is abelian of index at most for some , or some satisfies .
Proof. Suppose all those indices are at least . Put and . For , , one has and hence
A maximum clique in covers by at most such sets. Thus exactly sets partition , each with centralizer of index . The elements of each part commute pairwise: otherwise two of its vertices could replace its selected vertex, enlarging the clique. Moreover generates , since for and , both belong to that part. Thus is abelian.
Proposition 4.3 (Fourfold descent). If is nonnilpotent, one of the following holds:
(A) There is such that is abelian and .
(B) There are conjugate elements , with , such that is nonnilpotent. For , and ,
Here denotes the Fitting subgroup.
Proof. Apply Lemma 4.2 to . Outside its abelian alternative, choose with . Baer–Suzuki in its nilpotent formulation [16 p. 281] supplies a conjugate for which is nonnilpotent. The group fixes in , so its orbit on has size at most . Its stabilizer is , proving the index bounds. Finally is nonnilpotent and has a four-point clique by Lemma 2.4. Apply (7).
Losses for an abelian centralizer
Lemma 4.4 (Abelian centralizer losses). Let be nonnilpotent, abelian, and put , , and . Then , is nonnilpotent, and
If , then , , and has an abelian subgroup of loss . Consequently, for and ,
Proof. Since , a central element of lies in ; the reverse inclusion follows from the definition of . Also contains the nonnilpotent subgroup , so . Apply the central-loss budget to . If , Lemma 2.4 leaves only . The preimage of its subgroup of order three is abelian, since its quotient by the central subgroup is cyclic.
For , . For , the abelian loss has budget . If is a power of three, its ordinary cost gives the second term in (21). Otherwise the mixed surcharge gives , and hence the first term. At cap twelve the budget-seven refinement gives when . For , only remain to exclude: the losses cost at least , exceeding eleven.
Near-minimal ternary losses
The following theorem uses the prime-index result of Bergman and Lenstra. A noncentral commutator subgroup of order three would produce a local twelve-point clique; the central cost of the remaining dimensions then exceeds the available budget. This is the divisibility input for the ternary losses left by Lemma 4.4.
Theorem 4.5 (Near-minimal ternary losses). Let be abelian, with , and . If , then .
Proof. First force orbits of size at most three. Put . If , taking first in the central-loss sequence for and splitting off any factor two costs at least
exceeding its budget ; the splitting uses if the binary part also moves. Thus every -orbit in has size one or three.
Apply Bergman–Lenstra. Put and , where acts on by the inner automorphism induced by . This action is well defined and faithful, since its kernel is . We identify and with the normal factor and the complement in , respectively. If a normal subgroup of is contained in , then ; faithfulness gives . Thus has trivial core in . For , the orbit bound above gives . Since normalizes itself and , these are also all the possible indices for conjugation by . Both values occur: otherwise the action of the nontrivial group on would be trivial. By [3 Theorem 2], a normal subgroup of either lies in with a transitive permutation group of degree three, or contains with . The first case forces and , since a faithful abelian transitive group is regular, contrary to . Thus the second holds, and is normal of order three, since and . As and both and are normal in , we have . This commutator subgroup is nontrivial by faithfulness, so it is all of . The action defining the semidirect product identifies it with inside . Finally centralizes , because a -group acts trivially on , whose automorphism group has order two. The same holds for conjugation by .
A local twelve-point clique forces centrality. We claim that . Otherwise has index two; choose . Since is abelian and centralizes , the group is abelian. Moreover and normality of give , so is normal. Also for . There is not centralizing : otherwise , whereas and . The index-three subgroups intersect in with , because only contains . Put , and . The action of on is generated by the order-three action of , so ; also . For , we have . Indeed, if commutes with , then for every ,
the first equality uses and , and inverts . Thus . Also , so
Since this index bound holds for every , the averaging assertion in Lemma 2.2 gives a nine-point clique in . Choose with . The three elements , , form a clique in : the nontrivial commutator is central in and has order three. They are completely adjacent to , because for every . Hence . Applying the central-loss bound to now gives
a contradiction. Therefore , so is normal and makes .
Read off the divisibility. The commutator map is the homomorphism
Identify with the additive group of . The image is then a subspace of the dual of , with zero annihilator because . A proper subspace of this dual has a nonzero annihilator, by the dimension formula for the evaluation pairing. Thus the image is the whole dual. Its kernel is , so . Since , we obtain , proving the assertion.
Lifting the ternary loss. Return to the notation of Lemma 4.4, and put . If , , , and , then
For (22), lift an element of order three in to . Then is abelian with loss and index in . Theorem 4.5 gives , as required.
Saturation of an affine conjugacy class
In this subsection we write the conjugation action on a class using left conjugation. Choose a bijection from a finite abelian group onto the class . The law is affine if
Thus are labels in , whereas are elements of . Such a class is connected: the subgroup it generates acts transitively on it.
Lemma 4.6 (Affine saturation). Suppose a conjugacy class of has the affine law above, , and put . Then . If , then
Proof. Conjugation identifies with the inner group of . For the connected affine law, the standard descriptions give and ; see [1 Lemma 1.9, Corollary 1.25]. The elements , , are pairwise noncommuting, and every with fails to commute with all of them, since is invertible. Thus . Put . If , (18) gives
Hence . Conjugation embeds in , so , which implies the required divisibility.
Corollary 4.7 (Small conjugacy classes). Let and . If is prime, then ; if also , then . If and , either there is a conjugate with nonnilpotent and , or or .
Proof. Set and . Normality of makes all its orbits on equally large, so . This size is not one: otherwise , so is abelian and . If and , then by characteristicity. Baer–Suzuki in supplies with nonnilpotent. Since preserves and fixes , .
In the remaining cases, is connected. The prime-order theorem of Etingof–Soloviev–Guralnick [13] and Graña’s prime-square theorem [15 Proposition 3.10] make its law affine. Apply Lemma 4.6. For prime , has ; for nine, or has automorphism group of order six or 48, giving the two stated divisibilities.
Completion of the exact profile
We first establish the small caps and isolate the finite exceptions. Those exceptions are grouped by the mechanism that excludes them: ternary divisibility at caps eight, fourteen and sixteen, and affine saturation at cap ten. After this finite block, one numerical envelope completes the proof by induction.
The global upper bound
Proof of Theorem 1.1. The models in § 1 give every lower bound. Proposition 3.4 gives every nilpotent upper bound, and Lemma 2.4 settles all caps . We therefore consider nonnilpotent groups. It is enough to prove the bounds at cap five and at every even cap : each odd cap then follows from cap , since .
Step 1. A common budget for the two cases. In case (A) of Proposition 4.3, put , and . Then
In case (B), retain the selected class size and put , and . The accounting identity and fourfold amplification give
If is abelian, Lemma 4.4 gives . If is nonabelian, then . Whenever the profile is already known at , it gives .
Here is the numerical fact that lets us absorb this internal index. For , the respective values of are ; for , the binary formula gives . Thus for every , and
The second line uses the additive prime cost of the numerical majorant in the first line. Consequently, once the bound at is available, every selected centralizer satisfies . For all caps , we have , so the required bound at is already supplied by Lemma 2.4. For the later caps it will be supplied by induction.
Step 2. The base caps five and six. At cap five, the cases are already settled. If , Lemma 2.2 gives an irredundant cover by five centralizers with intersection , so by [8 Theorem 1.2].
At cap six, case (B) has , so is abelian. Since , this gives . In case (A), and , so an excess over requires .
For , the quotient has order thirty and a normal Sylow 5-subgroup. Indeed, otherwise its six Sylow 5-subgroups supply twenty-four nonidentity elements, forcing the Sylow 3-subgroup to be normal. The quotient of order ten then gives a normal cyclic subgroup of order fifteen; its Sylow 5-subgroup is characteristic and therefore normal in , a contradiction. Hence is normal. Let be the kernel of the action of on . Since , the map
is injective, and its image has exponent five because . Its order also divides six, so . This embeds the group , of order six, in , of order four. Thus and .
Step 3. The finite caps eight through sixteen. The following table records upper bounds for in each alternative. An entry at most closes that branch; a larger entry indicates a case still to be examined. A dash means that excludes a nonabelian . For case (A), use , sharpened at budgets seven and eleven to losses nine and thirty-six. For nonabelian , use from (24). For abelian , use , with the sharper at cap twelve from Lemma 4.4.
| case (A) | case (B) nonabelian | case (B) abelian | ||
| 8 | 81 | 72 | — | 126 |
| 10 | 256 | 270 | — | 648 |
| 12 | 1024 | 432 | 440 | 990 |
| 14 | 4096 | 1512 | 1404 | 4212 |
| 16 | 16384 | 3888 | 3780 | 17010 |
Table 1. Preliminary bounds for the finite caps. The three right-hand columns distinguish case (A) and the two possibilities for in case (B); the entries are bounds, not attained values.
The case is therefore settled. In case (A) the only possible excess is at cap ten, where , and require and or . The loss 26 costs fifteen, while loss 27 is excluded by Theorem 4.5, which would give . All remaining excesses thus have abelian selected .
We now treat caps eight, fourteen and sixteen together, and then return to ten. This order has no inductive dependency: throughout this finite block the only profile bounds used are those at caps at most five, already proved above.
Step 4. Three cases excluded by ternary divisibility. Assume in case (B), with abelian. At cap eight, if , Corollary 4.7 gives . Otherwise . Since and , the inequality then forces .
At cap fourteen, , and force and . Hence and . At cap sixteen, , and leave . But excludes 79 and 80, so ; the index constraints then give and .
Put and . At caps eight and fourteen, Lemma 4.4 gives . Since , the cap-five bound from Step 2 yields . Also and is nonnilpotent. For this leaves or 10; for it leaves or 12. The order-ten possibility is dihedral and has a six-point clique (five reflections and a nontrivial rotation), contradicting . At cap sixteen, , so and .
In every remaining row, . The ternary lifting criterion (22) now gives the contradictions in Table 2. The criterion requires respectively , and .
| required divisibility | ||||
| 8 | 30 | 3 | 6 | |
| 14 | 156 | 27 | 6 or 12 | |
| 16 | 210 | 81 | 6 |
Table 2. Divisibility obstructions in the three ternary cases. Each divisibility is forced by (22) and is incompatible with the displayed value of .
Step 5. The remaining cases at cap ten. It remains to consider cap ten with abelian. Here , and , so . Again put . Loss five is impossible: lift an element of prime order in . Together with , its lift generates an abelian subgroup of loss . The central-loss calculus assigns this loss a cost of at least ten, exceeding the available budget nine.
For , the central-loss cost is at least six; for this uses the mixed surcharge, and for the other values the ordinary cost suffices. Thus , unless loss seven already contradicts . The small-quotient lemma gives and . Lifting its subgroup of order three gives an abelian subgroup of loss . If , this is loss 24, whose mixed cost is ten, again impossible. If , (22) gives , contrary to . If , the same criterion gives ; together with , this forces , and the class-index constraints force .
Finally, if , excess requires . The constraints , then give and . We have reduced the entire cap-ten problem to
Apply Corollary 4.7. Either it supplies a new selected centralizer of index at most eighteen, giving , or it gives or . Both values 324 and 288 exceed 162, and neither divides 54 or 432. This settles cap ten and completes every cap through sixteen.
Step 6. Induction for all larger even caps. Proceed by strong induction on the even caps . In case (B), ; the profile bound needed in Step 1 follows from smaller caps. If is odd and , use the already proved even cap ; otherwise the bound at is already available. Since , we obtain
The same envelope covers case (A): , and . At the first cap,
The rational factor in the following ratio decreases with , so for every even ,
Since at the even caps, the envelope remains strictly below the target. This completes the induction and the proof of the exact profile.
Extremizers and the sharp constant
The cap five requires one elementary classification of alternating maps. It accounts for the two different extremal models at central index sixteen.
Lemma 5.1 (Nonsingular alternating maps in dimension four). Let , let be a finite-dimensional -space, and let be alternating and bilinear, with values spanning . Suppose that is nondegenerate for every nonzero . Up to linear identifications of and , precisely two possibilities occur:
(a) and is a nondegenerate symplectic form;
(b) , , and is the determinant over .
Proof. The scalar forms constitute a subspace of the alternating forms on , of dimension , since the values of span . For an alternating matrix of size four, its Pfaffian is
Consequently takes the value one on every nonzero element of . If contained a three-dimensional subspace, the sum of over that subspace would be one in , since there are seven nonzero vectors. But a polynomial of degree at most two on sums to zero: each of its monomials is one at an even number of vectors. Thus . Dimension one gives (a).
In dimension two, write , where , , are nondegenerate alternating forms, and define by . Choose a symplectic basis for , so its matrix is . Write the matrix of as
Since , the two-by-two Cayley–Hamilton identity gives
Indeed, the diagonal blocks follow from Cayley–Hamilton for , and the off-diagonal blocks use . Both and are invertible, since and are nondegenerate. Of the four monic quadratics over , only can annihilate such an operator. Hence
Let , where , and let act on as . The operator is self-adjoint for , because is symmetric. The -valued form is alternating and satisfies
It is therefore bilinear over and nondegenerate on the two-dimensional -space . A choice of basis makes it the determinant, proving (b). Conversely, both listed maps have the required property. For the determinant, if , the map is onto , so its composition with any nonzero -linear functional is nonzero. Thus no nonzero belongs to the radical of any nonzero scalarization, which proves the required nondegeneracy.
Proof of Theorem 1.2. For , the absence of a clique of size three forces to be abelian. Now assume . Every nontrivial value is a prime power. Hence a maximizer is nilpotent, with only one noncentral Sylow subgroup. For and , the noncyclic central quotient of order is . Thus has class two and two lifts of a basis, with the centre, generate . Their commutator is nontrivial and satisfies , so it generates . Conversely, such a scalar symplectic plane gives and .
At , write , where is its Sylow 2-subgroup and is central of odd order. Then and . The binary budget gives and forces to have class two with . The group is elementary abelian, since , so the commutator is an alternating bilinear map whose values span .
For every nonzero scalarization, equality in (9) forces , hence . Thus every scalar form of is nondegenerate. Lemma 5.1 identifies with either the scalar symplectic form or the determinant on . These are exactly the commutator maps of an extraspecial group of order 32 and of . Both models have and , as shown in the introduction. Their derived subgroups have orders two and four, so they are not isoclinic. This proves exhaustivity at cap five.
At , apply Theorem 3.3(iii) to the Sylow 3-subgroup. It gives , and . The converse is the scalar calculation.
Finally let , and . Theorem 3.5 applies with . Its second alternative is impossible because . Hence and , with . The converse follows from the binary symplectic clique calculation. In each scalar case a symplectic basis identifies the commutator map with that of the corresponding extraspecial group. Together with the cap-five classification, this proves all the asserted isoclinisms.
Proof of Corollary 1.3. For , the exact profile gives . For , comparison of the eight values of shows that the maximum is , reached only at and . Theorem 1.2(iv) gives its precise isoclinism class. The same exact formula yields the limit in (2); the extraspecial binary family proves optimality of the asymptotic base two.
Declarations
Funding. The author received no funding for this work.
Competing interests. The author declares no competing interests.
Data availability. No empirical datasets were generated or analysed during this theoretical study.
Use of AI-assisted tools. ChatGPT (OpenAI) was used as an assistant in checking mathematical proofs and in editing and formatting the LaTeX manuscript. The author takes full responsibility for the mathematical content and the final manuscript.
References
- [1]N. Andruskiewitsch and M. Graña, From racks to pointed Hopf algebras, Adv. Math. 178 (2003), no. 2, 177–243. doi:10.1016/S0001-8708(02)00071-3.DOI
- [2]A. Azad, S. Fouladi and R. Orfi, Maximal subsets of pairwise non-commuting elements of some finite p-groups, Bull. Iranian Math. Soc. 39 (2013), no. 1, 187–192. https://bims.iranjournals.ir/article_341.html.
- [3]G. M. Bergman and H. W. Lenstra, Jr., Subgroups close to normal subgroups, J. Algebra 127 (1989), no. 1, 80–97. doi:10.1016/0021-8693(89)90275-5.DOI
- [4]Y. Berkovich, Coverings of finite groups by few proper subgroups, Glas. Mat. Ser. III 45(65) (2010), no. 2, 415–429. doi:10.3336/gm.45.2.09.DOI
- [5]E. A. Bertram, Some applications of graph theory to finite groups, Discrete Math. 44 (1983), no. 1, 31–43. doi:10.1016/0012-365X(83)90004-3.DOI
- [6]A. E. Brouwer, An inequality in binary vector spaces, Discrete Math. 59 (1986), no. 3, 315–317. doi:10.1016/0012-365X(86)90177-9.DOI
- [7]A. E. Brouwer and H. Van Maldeghem, Strongly Regular Graphs, Encyclopedia of Mathematics and its Applications, vol. 182, Cambridge University Press, Cambridge, 2022. doi:10.1017/9781009057226.DOI
- [8]R. A. Bryce, V. Fedri and L. Serena, Covering groups with subgroups, Bull. Aust. Math. Soc. 55 (1997), no. 3, 469–476. doi:10.1017/S0004972700034109.
- [9]M. Ceria, J. De Beule, F. Pavese and V. Smaldore, On large partial ovoids of symplectic and Hermitian polar spaces, J. Combin. Des. 31 (2023), no. 1, 5–22. doi:10.1002/jcd.21864.DOI
- [10]A. Y. M. Chin, On non-commuting sets in an extraspecial p-group, J. Group Theory 8 (2005), no. 2, 189–194. doi:10.1515/jgth.2005.8.2.189.DOI
- [11]M. Cimráková and V. Fack, Searching for maximal partial ovoids and spreads in generalized quadrangles, Bull. Belg. Math. Soc. Simon Stevin 12 (2005), no. 5, 697–705. https://biblio.ugent.be/publication/358180.DOI
- [12]P. Erdős and E. G. Straus, How abelian is a finite group?, Linear Multilinear Algebra 3 (1976), no. 4, 307–312. doi:10.1080/03081087608817122.DOI
- [13]P. Etingof, A. Soloviev and R. M. Guralnick, Indecomposable set-theoretical solutions to the quantum Yang–Baxter equation on a set with a prime number of elements, J. Algebra 242 (2001), no. 2, 709–719. doi:10.1006/jabr.2001.8842.DOI
- [14]S. Fouladi and R. Orfi, Maximum size of subsets of pairwise noncommuting elements in finite metacyclic p-groups, Bull. Aust. Math. Soc. 87 (2013), no. 1, 18–23. doi:10.1017/S0004972712000111.DOI
- [15]M. Graña, Indecomposable racks of order p², Beitr. Algebra Geom. 45 (2004), no. 2, 665–676. https://emis.de/ft/11132.
- [16]R. M. Guralnick and G. R. Robinson, On extensions of the Baer–Suzuki theorem, Israel J. Math. 82 (1993), 281–297. doi:10.1007/BF02808114.DOI
- [17]P. Hall, The classification of prime-power groups, J. reine angew. Math. 182 (1940), 130–141. doi:10.1515/crll.1940.182.130.DOI
- [18]H. Liu and Y. Wang, On non-commuting sets in certain finite p-groups, Algebra Colloq. 22 (2015), no. 4, 555–560. doi:10.1142/S1005386715000474.DOI
- [19]B. H. Neumann, Groups covered by finitely many cosets, Publ. Math. Debrecen 3 (1954), 227–242. doi:10.5486/PMD.1954.3.3-4.07.
- [20]B. H. Neumann, A problem of Paul Erdős on groups, J. Austral. Math. Soc. Ser. A 21 (1976), no. 4, 467–472. doi:10.1017/S1446788700019303.DOI
- [21]L. Pyber, The number of pairwise non-commuting elements and the index of the centre in a finite group, J. London Math. Soc. (2) 35 (1987), no. 2, 287–295. doi:10.1112/jlms/s2-35.2.287.DOI
- [22]M. J. Tomkinson, Groups covered by finitely many cosets or subgroups, Comm. Algebra 15 (1987), no. 4, 845–859. doi:10.1080/00927878708823445.DOI
- [23]M. Zarrin, On noncommuting sets and centralisers in infinite groups, Bull. Aust. Math. Soc. 93 (2016), no. 1, 42–46. doi:10.1017/S0004972715000696.DOI