Results 21 to 30 of about 9,212,172 (248)
On Edge-Primitive Graphs of Order as a Product of Two Distinct Primes
A graph is edge-primitive if its automorphism group acts primitively on the edge set of the graph. Edge-primitive graphs form an important subclass of symmetric graphs. In this paper, edge-primitive graphs of order as a product of two distinct primes are
Renbing Xiao, Xiaojiao Zhang, Hua Zhang
doaj +1 more source
Base sizes of primitive groups of diagonal type
Let G be a permutation group on a finite set $\Omega $ . The base size of G is the minimal size of a subset of $\Omega $ with trivial pointwise stabiliser in G. In this paper, we extend earlier work of Fawcett by determining the precise base
Hong Yi Huang
doaj +1 more source
ON SOME VERTEX-TRANSITIVE DISTANCE-REGULAR ANTIPODAL COVERS OF COMPLETE GRAPHS
In the present paper, we classify abelian antipodal distance-regular graphs \(\Gamma\) of diameter 3 with the following property: \((*)\) \(\Gamma\) has a transitive group of automorphisms \(\widetilde{G}\) that induces a primitive almost simple ...
Ludmila Yu. Tsiovkina
doaj +1 more source
The Dade group of a fusion system. [PDF]
We define the notion of the Dade group of a fusion system and show that some of the gluing and detection results for Dade groups of finite p-groups due to Bouc and Thévenaz in [S. Bouc and J. Thévenaz. Gluing torsion endo-permutation modules. (Preprint.)]
Mazza, Nadia, Linckelmann, Markus
core +5 more sources
On Transitive Permutation Groups with Primitive Subconstituents [PDF]
The authors investigate transitive permutation groups \(G\) acting on a set \(\Omega\) of arbitrary cardinality such that the stabilizer \(G_\omega\) in \(G\) of a point \(\omega\in\Omega\) acts primitively on each nontrivial orbit (i.e. of size at least \(2\)) in \(\Omega\).
Pasechnik, Dmitrii V. +1 more
openaire +5 more sources
On base sizes for symmetric groups [PDF]
A base of a permutation group G on a set is a subset B of such that the pointwise stabilizer of B in G is trivial. The base size of G, denoted by b(G), is the minimal cardinality of a base.
Guralnick, Robert M. +7 more
core +2 more sources
Topics in computational group theory : primitive permutation groups and matrix group normalisers [PDF]
Part I of this thesis presents methods for finding the primitive permutation groups of degree d, where 2500 ≤ d < 4096, using the O'Nan-Scott Theorem and Aschbacher's theorem. Tables of the groups G are given for each O'Nan-Scott class.
Coutts, Hannah Jane
core +2 more sources
Sync-Maximal Permutation Groups Equal Primitive Permutation Groups [PDF]
The set of synchronizing words of a given $n$-state automaton forms a regular language recognizable by an automaton with $2^n - n$ states. The size of a recognizing automaton for the set of synchronizing words is linked to computational problems related to synchronization and to the length of synchronizing words.
openaire +3 more sources
The Dade group of a metacyclic $p$-group. [PDF]
The Dade group $D(P)$ of a finite $p$-group $P$, formed by equivalence classes of endo-permutation modules, is a finitely generated abelian group. Its torsion-free rank equals the number of conjugacy classes of non-cyclic subgroups of $P$ and it is ...
Mazza, Nadia
core +5 more sources
Imprimitive permutations in primitive groups
The goal of this paper is to study primitive groups that are contained in the union of maximal (in the symmetric group) imprimitive groups. The study of types of permutations that appear inside primitive groups goes back to the origins of the theory of permutation groups. However, this is another instance of a situation common in mathematics in which a
J. Araújo +5 more
openaire +6 more sources

