Positivity Results for Cyclic Subgroups

• Cyclic subgroups are subgroups generated by a single element that reveal key structural and quantitative properties across various algebraic systems.
• Enumerative positivity results establish sharp lower bounds and uniqueness criteria, illustrating that non-cyclic groups exceed the cyclic minimal counts.
• Positivity phenomena extend to representation theory, elliptic curves, and combinatorial structures, underpinning cyclic subgroup separability and group decompositions.

A cyclic subgroup is a subgroup generated by a single element. Positivity results for cyclic subgroups encompass both enumerative inequalities and structural properties asserting the abundance, prevalence, or stability of cyclic subgroups within algebraic or combinatorial contexts. These results arise across finite group theory, representation theory, algebraic geometry, geometric group theory, and algebraic combinatorics, often providing sharp characterizations and effective lower bounds.

1. Enumerative Positivity: Counting Cyclic Subgroups in Finite Groups

For a finite group $G$ of order $n$, denote by $c_m(G)$ the number of cyclic subgroups of order $m$, and let $c(G) = \sum_{m|n} c_m(G)$ be the total number of cyclic subgroups. In the landmark result of (Garonzi et al., 2015), it is shown that among all groups of order $n$, the cyclic group $C_n$ uniquely minimizes the number of cyclic subgroups: $c(G) \geq c(C_n) = d(n),$ where $d(n)$ is the number of positive divisors of $n$. Equality holds if and only if $n$0 is cyclic. The proof leverages Frobenius's theorem on solution counts of $n$1 (ensuring each solution count is divisible by $n$2) and applies Möbius inversion, which, through positivity-weighted sums, forces all non-cyclic structures to have strictly more cyclic subgroups.

The same work also considers the invariant

$n$3

where $n$4 is the set of cyclic subgroups, establishing that for any finite group,

$n$5

with equality characterized precisely via structural constraints involving $n$6 and the orders of elements in the cosets, leading to ramifications for the structure being essentially 2-central or 4-abelian for equality (Tărnăuceanu, 2020).

2. Extremality and Cyclicity Detection via Element-Order Products and Generalized Sums

Another positivity result regards the extremal behavior of the product of element orders: $n$7 where $n$8 is the order of $n$9. It is proved that

$c_m(G)$0

with equality if and only if $c_m(G)$1 is cyclic (Garonzi et al., 2015). The proof uses divisor sums and explicit combinatorial weights to show the extremal property of the cyclic group.

Beyond these, a general two-parameter family of invariants is introduced: $c_m(G)$2 where $c_m(G)$3 is Euler’s totient function. For $c_m(G)$4, nilpotent groups maximize $c_m(G)$5, with cyclic groups being the unique maximizers in certain parameter regimes. These inequalities not only detect cyclicity and nilpotency, but, by parameter choice, test other structure, raising further open questions on broader group properties detectable through such positivity frameworks.

3. Positivity of Branching Coefficients for Cyclic Subgroups in Representations

Let $c_m(G)$6 be the cyclic subgroup generated by an $c_m(G)$7-cycle, and let $c_m(G)$8 denote its linear characters. For the irreducible $c_m(G)$9-characters $m$0, the branching coefficient for the $m$1-isotypic component is

$m$2

The main result of (S, 16 Dec 2025) is a complete classification of positivity: except for finitely many explicit partitions $m$3 (the “extremal” shapes: $m$4, $m$5, $m$6, $m$7 and, for $m$8 even, two more shapes at $m$9), all coefficients $c(G) = \sum_{m|n} c_m(G)$0 satisfy

$c(G) = \sum_{m|n} c_m(G)$1

for all $c(G) = \sum_{m|n} c_m(G)$2 and for all $c(G) = \sum_{m|n} c_m(G)$3. Furthermore, $c(G) = \sum_{m|n} c_m(G)$4 only for these extremal cases and $c(G) = \sum_{m|n} c_m(G)$5 only on the “first hooks”. This result both unifies and strengthens earlier lower bounds, being valid uniformly for all remaining partitions and characters. The proof combines combinatorial methods (Littlewood–Richardson structures, partition reduction, and modular branching) and specializes broader branching to the cyclic subgroup.

Partition $c(G) = \sum_{m|n} c_m(G)$6	$c(G) = \sum_{m|n} c_m(G)$7 for some $c(G) = \sum_{m|n} c_m(G)$8?	$c(G) = \sum_{m|n} c_m(G)$9 for some $n$0?
$n$1	Yes	No
$n$2	No	Yes
Others	No	No

4. Positivity for Galois-Stable Cyclic Subgroups on Elliptic Curves

Let $n$3 denote the number of $n$4-isomorphism classes of elliptic curves of height at most $n$5 with at least $n$6 pairs of Galois-stable cyclic subgroups of order $n$7. It is proved in (Pomerance et al., 2020) that the counts exhibit positive main terms: $n$8 with explicitly computable constants $n$9. For $C_n$0, $C_n$1 since algebraically, only up to two pairs can be Galois-stable over $C_n$2. The positivity of the main terms establishes not only non-trivial existence but density results for such elliptic curves.

Techniques include explicit parametrization via binary forms, geometry-of-numbers estimates leveraging Huxley's strong Lipschitz principle, and careful analytic control of error terms through Möbius inversion and Dirichlet series, all ensuring the precise positivity of the asymptotic growth.

5. Positivity in Geometric Group Theory: Separability and Stability

A group $C_n$3 is cyclic subgroup separable (CSS) if every cyclic subgroup is closed in the profinite topology; for a prime $C_n$4, $C_n$5 is $C_n$6-CSS if every $C_n$7-isolated cyclic subgroup is closed in the pro-$C_n$8 topology. In (Berlai et al., 2018), it is shown that the CSS property is preserved under graph products: if all vertex groups in a finite simplicial graph product are CSS, the graph product is again CSS. Similarly, $C_n$9-CSS is preserved under graph products within the class $c(G) \geq c(C_n) = d(n),$0 of torsion-free groups with unique roots and primitive stability. Every right-angled Artin group is thus CSS and $c(G) \geq c(C_n) = d(n),$1-CSS for every $c(G) \geq c(C_n) = d(n),$2.

Classification of $c(G) \geq c(C_n) = d(n),$3-isolated cyclic subgroups in right-angled Artin groups is explicit: a cyclic subgroup is $c(G) \geq c(C_n) = d(n),$4-isolated if and only if it is generated by a primitive element raised to a $c(G) \geq c(C_n) = d(n),$5-th power. The result gives a positivity property for closure/separability: the abundance and stability of cyclic subgroups under group-theoretic constructions.

6. Positivity of Cyclic Decompositions: Active Sums and Metacyclic Groups

The notion of the active sum of a family $c(G) \geq c(C_n) = d(n),$6 of subgroups generalizes the direct sum for abelian groups. For $c(G) \geq c(C_n) = d(n),$7 a finite group, the active sum $c(G) \geq c(C_n) = d(n),$8 of a discrete family $c(G) \geq c(C_n) = d(n),$9 of cyclic subgroups is constructed as the quotient of the free product modulo relations encoding conjugacy and action, with a canonical surjection $d(n)$0. For this surjection to be an isomorphism, $d(n)$1 must be regular and independent.

In (Díaz-Barriga et al., 2014), it is shown that every finite metacyclic group can be reconstructed as the active sum of a discrete family of cyclic subgroups, positively realizing $d(n)$2 as built entirely from cyclic subgroups. Concretely, both split and non-split metacyclic $d(n)$3-groups, and groups with Hall decomposition, can always be realized this way. This provides a comprehensive positivity result within the framework of group decompositions, contrasting with known negative results for certain simple groups.

7. Positivity Phenomena in Algebraic and Combinatorial Representations

Positivity for cyclic subgroups also arises in enumerative and geometric combinatorics. In (Adin et al., 2022), new cyclic descent extensions for involutions, standard Young tableaux, and Motzkin paths are constructed, with explicit actions by the cyclic group. The associated quasisymmetric generating functions display Schur-positivity: they expand as symmetric functions with nonnegative coefficients in the Schur basis, an intrinsically positive phenomenon aligning with deep representation-theoretic patterns.

Through explicit bijections and cyclic group actions, the construction ensures that positivity features—such as equidistribution and symmetry—emerge for these statistics, reinforcing the structural role of cyclic subgroups in algebraic combinatorics.

---

In summary, positivity results for cyclic subgroups—whether in enumeration, representation branching, algebraic stability, or geometric constructions—provide sharp tools for characterizing group and module structure, detecting extremality, guaranteeing explicit lower bounds, and constructing group-theoretic and combinatorial objects with desirable properties. These results interconnect diverse areas including finite group theory, representation theory, algebraic geometry, geometric group theory, and algebraic combinatorics, often providing the essential foundation for deeper structural insights.