Generating sequences of \(\mathrm{PSL}(2,p)\). (Q471845): Difference between revisions
From MaRDI portal
Set profile property. |
Changed an Item |
||
(One intermediate revision by one other user not shown) | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W3102415177 / rank | |||
Normal rank | |||
Property / arXiv ID | |||
Property / arXiv ID: 1210.2073 / rank | |||
Normal rank |
Latest revision as of 15:01, 18 April 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Generating sequences of \(\mathrm{PSL}(2,p)\). |
scientific article |
Statements
Generating sequences of \(\mathrm{PSL}(2,p)\). (English)
0 references
17 November 2014
0 references
A generating set \(\{g_i\}\) or sequence \(\{g_i\}_{i\in I}\) for the group \(G\) is called irredundant if, after removing any \(g_j\) from the set or sequence, the new collection no longer generates \(G\). J. Whiston and J. Saxl showed that the size of an irredundant generating set of the group \(G=\mathrm{PSL}(2,p)\) is at most four and computed the size \(m(G)\) of a maximal set for many primes. The author extends this result to a larger class of primes, with the surprising result that, when \(p\not\equiv\pm 1\bmod{10}\), \(m(G)=3\) except for the special case \(p=7\). In addition, he determines which orders of elements in irredundant generating sets of \(\mathrm{PSL}(2,p)\) with lengths less than or equal to four are possible in most cases. He also gives some remarks about the behavior of \(\mathrm{PSL}(2,p)\) with respect to the replacement property for groups.
0 references
projective linear groups over finite fields
0 references
irredundant generating sets
0 references
lengths of generating sequences
0 references