English

The maximal rank of a string group generated by involutions for alternating groups

Group Theory 2025-08-12 v2 Combinatorics

Abstract

A string group generated by involutions, or SGGI, is a pair Γ=(G,S)\Gamma=(G, S), where GG is a group and S={ρ0,,ρr1}S=\{\rho_0,\ldots, \rho_{r-1}\} is an ordered set of involutions generating GG and satisfying the commuting property: i,j{0,,r1},  ij1(ρiρj)2=1.\forall i,j\in\{0,\ldots, r-1\}, \;|i-j|\ne 1\Rightarrow (\rho_i\rho_j)^2=1. When SS is an independent set, the rank of Γ\Gamma is the cardinality of SS. We determine an upper bound for the rank of an SGGI over the alternating group of degree nn. Our bound is tight when n0,1,4(mod5)n\equiv 0,1,4\pmod 5.

Keywords

Cite

@article{arxiv.2505.09169,
  title  = {The maximal rank of a string group generated by involutions for alternating groups},
  author = {Jessica Anzanello and Maria Elisa Fernandes and Pablo Spiga},
  journal= {arXiv preprint arXiv:2505.09169},
  year   = {2025}
}

Comments

28 pages