The maximal rank of a string group generated by involutions for alternating groups
The maximal rank of a string group generated by involutions for alternating groups
A string group generated by involutions, or SGGI, is a pair $\Gamma=(G, S)$, where $G$ is a group and $S=\{\rho_0,\ldots, \rho_{r-1}\}$ is an ordered set of involutions generating $G$ and satisfying the commuting property: $$\forall i,j\in\{0,\ldots, r-1\}, \;|i-j|\ne 1\Rightarrow (\rho_i\rho_j)^2=1.$$ When $S$ is an independent set, the rank of $\Gamma$ 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\equiv 0,1,4\pmod 5$.
Jessica Anzanello、Maria Elisa Fernandes、Pablo Spiga
数学
Jessica Anzanello,Maria Elisa Fernandes,Pablo Spiga.The maximal rank of a string group generated by involutions for alternating groups[EB/OL].(2025-05-14)[2025-06-08].https://arxiv.org/abs/2505.09169.点此复制
评论