AbstractWe give a short proof of the fact, known to Jordan (J. Math. (5) 1 (1895), 35–60), that any permutation group of degree n other than the symmetric and alternating groups is at most c(log n)2(log log n)-fold transitive
[EN] There are different ways to associate to a group a certain graph. In this context, it is inter...
AbstractIf a sequence of transitive permutation groups G of degree n have orders which are not too l...
Bounding the order of a primitive permutation group in terms of its degree was a problem of 19-th ce...
AbstractWe give a short proof of the fact, known to Jordan (J. Math. (5) 1 (1895), 35–60), that any ...
Peer Reviewedhttp://deepblue.lib.umich.edu/bitstream/2027.42/135601/1/plms0052.pd
These are notes for a talk on Wielandt’s proof of Burnside’s theorem regarding transitive permutatio...
AbstractExtending ideas of L. Babai we give an nclog2n bound for the orders of 2-transitive groups o...
In 1990 Hendrik W. Lenstra, Jr. asked the following question: if G is a transitive permutation group...
In 1990 Hendrik W. Lenstra, Jr. asked the following question: if G is a transitive permutation group...
In 1990 Hendrik W. Lenstra, Jr. asked the following question: if G is a transitive permutation group...
AbstractWe prove that if a permutation group G of degree n has no alternating composition factors of...
This paper describes a simple method for constructing all the pairwise non-conjugate transitive grou...
AbstractThis paper presents a new algorithm to classify all transitive subgroups of the symmetric gr...
This thesis discusses upper bounds on the minimal number of elements d(G) required to generate a fin...
Building on earlier papers of several authors, we establish that there exists a universal constan...
[EN] There are different ways to associate to a group a certain graph. In this context, it is inter...
AbstractIf a sequence of transitive permutation groups G of degree n have orders which are not too l...
Bounding the order of a primitive permutation group in terms of its degree was a problem of 19-th ce...
AbstractWe give a short proof of the fact, known to Jordan (J. Math. (5) 1 (1895), 35–60), that any ...
Peer Reviewedhttp://deepblue.lib.umich.edu/bitstream/2027.42/135601/1/plms0052.pd
These are notes for a talk on Wielandt’s proof of Burnside’s theorem regarding transitive permutatio...
AbstractExtending ideas of L. Babai we give an nclog2n bound for the orders of 2-transitive groups o...
In 1990 Hendrik W. Lenstra, Jr. asked the following question: if G is a transitive permutation group...
In 1990 Hendrik W. Lenstra, Jr. asked the following question: if G is a transitive permutation group...
In 1990 Hendrik W. Lenstra, Jr. asked the following question: if G is a transitive permutation group...
AbstractWe prove that if a permutation group G of degree n has no alternating composition factors of...
This paper describes a simple method for constructing all the pairwise non-conjugate transitive grou...
AbstractThis paper presents a new algorithm to classify all transitive subgroups of the symmetric gr...
This thesis discusses upper bounds on the minimal number of elements d(G) required to generate a fin...
Building on earlier papers of several authors, we establish that there exists a universal constan...
[EN] There are different ways to associate to a group a certain graph. In this context, it is inter...
AbstractIf a sequence of transitive permutation groups G of degree n have orders which are not too l...
Bounding the order of a primitive permutation group in terms of its degree was a problem of 19-th ce...
DOI
Add to ORKG