Permutations which make transitive groups primitive. (Q2268542)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5678475
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Permutations which make transitive groups primitive. |
scientific article; zbMATH DE number 5678475 |
Statements
Permutations which make transitive groups primitive. (English)
0 references
8 March 2010
0 references
In the present paper the author studies some straightforward elementary conditions which ensure that a finite transitive permutation group \(G\) of degree \(d\) is primitive. The conditions considered are mostly that \(G\) contains a permutation having some specific cycle type, e.g. \([1,d-1]\) or \([n_1,\dots,n_r]\) where \(\gcd(n_i,n_j)=1\) for \(i\neq j\) and such that for no partition of the set \(\{n_1,\dots,n_r\}\) the parts add up to a constant proper divisor of \(d=\sum n_i\).
0 references
finite permutation groups
0 references
transitive permutation groups
0 references
primitive permutation groups
0 references
cycle types
0 references
generators
0 references
partitions
0 references
blocks
0 references
0.92806214
0 references
0.92099154
0 references
0.9182957
0 references
0.91178316
0 references
0 references
0 references
0 references