Answers are grounded in this paper and cite their sources.
Determines an upper bound for the rank of string groups generated by involutions in alternating groups, indicating significant structural properties.
A string group generated by involutions, or SGGI, is a pair <m:math xmlns:m="http://www.w3.org/1998/Math/MathML"> <m:mrow> <m:mi mathvariant="normal">Γ</m:mi> <m:mo>=</m:mo> <m:mrow> <m:mo stretchy="false">(</m:mo> <m:mi>G</m:mi> <m:mo>,</m:mo> <m:mi>S</m:mi> <m:mo stretchy="false">)</m:mo> </m:mrow> </m:mrow> </m:math> Γ=(G,S) , where 𝐺 is a group and <m:math xmlns:m="http://www.w3.org/1998/Math/MathML"> <m:mrow> <m:mi>S</m:mi> <m:mo>=</m:mo> <m:mrow> <m:mo stretchy="false">{</m:mo> <m:msub> <m:mi>ρ</m:mi> <m:mn>0</m:mn> </m:msub> <m:mo>,</m:mo> <m:mi mathvariant="normal">…</m:mi> <m:mo>,</m:mo> <m:msub> <m:mi>ρ</m:mi> <m:mrow> <m:mi>r</m:mi> <m:mo>−</m:mo> <m:mn>1</m:mn> </m:mrow> </m:msub> <m:mo stretchy="false">}</m:mo> </m:mrow> </m:mrow> </m:math> S=\{ρ₀,…,ρᵣ₋₁\} is an ordered set of involutions generating 𝐺 and satisfying the following commuting property: for all <m:math xmlns:m="http://www.w3.org/1998/Math/MathML"> <m:mrow> <m:mrow> <m:mi>i</m:mi> <m:mo>,</m:mo> <m:mi>j</m:mi> </m:mrow> <m:mo>∈</m:mo> <m:mrow> <m:mo stretchy="false">{</m:mo> <m:mn>0</m:mn> <m:mo>,</m:mo> <m:mi mathvariant="normal">…</m:mi> <m:mo>,</m:mo> <m:mrow> <m:mi>r</m:mi> <m:mo>−</m:mo> <m:mn>1</m:mn> </m:mrow> <m:mo stretchy="false">}</m:mo> </m:mrow> </m:mrow> </m:math> i,j∈\{0,…,r-1\} , <m:math xmlns:m="http://www.w3.org/1998/Math/MathML"> <m:mrow> <m:mrow> <m:mo stretchy="false">|</m:mo> <m:mrow> <m:mi>i</m:mi> <m:mo>−</m:mo> <m:mi>j</m:mi> </m:mrow> <m:mo stretchy="false">|</m:mo> </m:mrow> <m:mo>≠</m:mo> <m:mn>1</m:mn> </m:mrow> </m:math> i-j≠ 1 implies <m:math xmlns:m="http://www.w3.org/1998/Math/MathML"> <m:mrow> <m:msup> <m:mrow> <m:mo stretchy="false">(</m:mo> <m:mrow> <m:msub> <m:mi>ρ</m:mi> <m:mi>i</m:mi> </m:msub> <m:mo></m:mo> <m:msub> <m:mi>ρ</m:mi> <m:mi>j</m:mi> </m:msub> </m:mrow> <m:mo stretchy="false">)</m:mo> </m:mrow> <m:mn>2</m:mn> </m:msup> <m:mo>=</m:mo> <m:mn>1</m:mn> </m:mrow> </m:math> (ρᵢρⱼ)²=1 . When 𝑆 is an independent set, the rank of Γ is the cardinality of 𝑆. We determine an upper bound for the rank of an SGGI over the alternating group of degree 𝑛. Our bound is tight when <m:math xmlns:m="http://www.w3.org/1998/Math/MathML"> <m:mrow> <m:mi>n</m:mi> <m:mo>≡</m:mo> <m:mrow> <m:mn>0</m:mn> <m:mo>,</m:mo> <m:mn>1</m:mn> <m:mo>,</m:mo> <m:mrow> <m:mn>4</m:mn> <m:mo lspace="0.500em"></m:mo> <m:mrow> <m:mo stretchy="false">(</m:mo> <m:mrow> <m:mi>mod</m:mi> <m:mo></m:mo> <m:mn>5</m:mn> </m:mrow> <m:mo stretchy="false">)</m:mo> </m:mrow> </m:mrow> </m:mrow> </m:mrow> </m:math> n≡ 0,1,4\ (mod\ {5}) .
No takes yet. Share an insight, caveat, or question.
Anzanello et al. (2026) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: