Answers are grounded in this paper and cite their sources.
This analysis determines the upper bound of maximal rank for string groups generated by involutions, suggesting tightness under specific conditions.
A string group generated by involutions, or SGGI, is a pair $Γ=(G, S)$, where G is a group and S=\ρ₀,…, ρᵣ₋₁\ is an ordered set of involutions generating G and satisfying the commuting property: ∀ i,j∈\0,…, r-1\, \;|i-j|≠ 1⇒ (ρᵢρⱼ)²=1. When S is an independent set, the rank of $Γ$ is the cardinality of S. We determine an upper bound for the rank of an SGGI over the alternating group of degree n. Our bound is tight when n≡ 0,1,4 5.
No takes yet. Share an insight, caveat, or question.
Anzanello et al. (2025) studied this question.
Synapse has enriched 8 closely related papers on similar clinical questions. Consider them for comparative context: