AbstractIf a sequence of transitive permutation groups G of degree n have orders which are not too large (log¦G¦ = o(n12) suffices), then the number of orbits on the power set is asymptotically 2n/¦G¦, and almost all of these orbits are regular. This conclusion holds in particular for primitive groups
Abstract Let G be a permutation group acting on a set of size n ∈ N and let 1 ≤ k < (n − 1)/2. L...
For a transitive permutation group G on a finite set Ω, the Livingstone–Wagner The-orem states that ...
Let G be a transitive permutation group acting on a finite set X. Recall that G is primitive if ther...
AbstractIf a sequence of transitive permutation groups G of degree n have orders which are not too l...
AbstractGiven a permutation group G acting on a set X we consider the orbits of the induced group on...
AbstractThis paper presents a theorem on the growth rate of the orbit-counting sequences of a primit...
We construct and characterise a 3-homogeneous but not 2-primitive permutation group H of countable d...
Let G be a transitive permutation group on a set Ω such that, for ω∈Ω, the stabiliser Gω induces on ...
AbstractWe prove that if a permutation group G of degree n has no alternating composition factors of...
Suppose that G is a simply transitive primitive permutation group on a finite set Ω such that for α ...
AbstractSuppose that a finite solvable group G acts faithfully, irreducibly and quasi-primitively on...
AbstractWe prove that if a permutation group G of degree n has no alternating composition factors of...
AbstractWe consider primitive subgroups G of the symmetric group Sn, and the sizes of their orbits o...
AbstractThis paper discusses investigations of sequences of natural numbers which count the orbits o...
This paper discusses investigations of sequences of natural numbers which count the orbits of an inf...
Abstract Let G be a permutation group acting on a set of size n ∈ N and let 1 ≤ k < (n − 1)/2. L...
For a transitive permutation group G on a finite set Ω, the Livingstone–Wagner The-orem states that ...
Let G be a transitive permutation group acting on a finite set X. Recall that G is primitive if ther...
AbstractIf a sequence of transitive permutation groups G of degree n have orders which are not too l...
AbstractGiven a permutation group G acting on a set X we consider the orbits of the induced group on...
AbstractThis paper presents a theorem on the growth rate of the orbit-counting sequences of a primit...
We construct and characterise a 3-homogeneous but not 2-primitive permutation group H of countable d...
Let G be a transitive permutation group on a set Ω such that, for ω∈Ω, the stabiliser Gω induces on ...
AbstractWe prove that if a permutation group G of degree n has no alternating composition factors of...
Suppose that G is a simply transitive primitive permutation group on a finite set Ω such that for α ...
AbstractSuppose that a finite solvable group G acts faithfully, irreducibly and quasi-primitively on...
AbstractWe prove that if a permutation group G of degree n has no alternating composition factors of...
AbstractWe consider primitive subgroups G of the symmetric group Sn, and the sizes of their orbits o...
AbstractThis paper discusses investigations of sequences of natural numbers which count the orbits o...
This paper discusses investigations of sequences of natural numbers which count the orbits of an inf...
Abstract Let G be a permutation group acting on a set of size n ∈ N and let 1 ≤ k < (n − 1)/2. L...
For a transitive permutation group G on a finite set Ω, the Livingstone–Wagner The-orem states that ...
Let G be a transitive permutation group acting on a finite set X. Recall that G is primitive if ther...
DOI
Add to ORKG