Doubly Primitive Vertex Stabilisers in Graphs.
Doubly transitive permutation groups with abelian stabilizers.
Edge-Transitivity of Cayley Graphs Generated by Transpositions
Let S be a set of transpositions generating the symmetric group Sn (n ≥ 5). The transposition graph of S is defined to be the graph with vertex set {1, . . . , n}, and with vertices i and j being adjacent in T(S) whenever (i, j) ∈ S. In the present note, it is proved that two transposition graphs are isomorphic if and only if the corresponding two Cayley graphs are isomorphic. It is also proved that the transposition graph T(S) is edge-transitive if and only if the Cayley graph Cay(Sn, S) is edge-transitive....
Ein spiegelungsgeometrischer Aufbau der Galileischen Geometrie
Eine abstrakte Definition gewisser alternierender Gruppen.
Embeddings into Simple Lattice-ordered Groups with Different First Order Theories.
Equiangular Lines, the Graph Extension Theorem, and Transfer in Triply Transitive Groups.
Equivalence classes of functions over a finite field
Equivalence classes of polynomials over finite fields
Equivalence classes of sets of functions over a finite field
Equivalence Systems with Finitely Many Relations.
Estimation of Sylow Subgroups in Primitive Permutation Groups.
Eulerian numbers, Foulkes characters and Lefschetz characters of the symmetric group.
Every reasonably sized matrix group is a subgroup of S ∞
Every reasonably sized matrix group has an injective homomorphism into the group of all bijections of the natural numbers. However, not every reasonably sized simple group has an injective homomorphism into .
Examples of highly transitive permutation groups
Examples of non-shy sets
Christensen has defined a generalization of the property of being of Haar measure zero to subsets of (abelian) Polish groups which need not be locally compact; a recent paper of Hunt, Sauer, and Yorke defines the same property for Borel subsets of linear spaces, and gives a number of examples and applications. The latter authors use the term “shyness” for this property, and “prevalence” for the complementary property. In the present paper, we construct a number of examples of non-shy Borel sets...
Exercises dyadiques.
Exponential Riordan arrays and permutation enumeration.
Exposé d'une théorie nouvelle des substitutions
Extension of Some Results of Manning and Wielandt on Primitive Permutation Groups.