Results 31 to 40 of about 9,212,172 (248)
Normalizers of primitive permutation groups
Advances in Mathematics, 2017 44 pages, grant numbers updated, referee's comments ...
Robert M. Guralnick +2 more
openaire +3 more sources
Most primitive groups are full automorphism groups of edge-transitive hypergraphs [PDF]
, 2014 We prove that, for a primitive permutation group G acting on a set X of size n, other than the alternating group, the probability that Aut (X,YG) = G for a random subset Y of X, tends to 1 as n → ∞.
Cameron, Peter Jephson +2 more
core +1 more source
Minimal and random generation of permutation and matrix groups [PDF]
, 2012 We prove explicit bounds on the numbers of elements needed to generate various types of finite permutation groups and finite completely reducible matrix groups, and present examples to show that they are sharp in all cases.
Derek F. Holt +5 more
core +1 more source
Endo-permutation modules as sources of simple modules. [PDF]
, 2003 The source of a simple $kG$-module, for a finite $p$-solvable group $G$ and an algebraically closed field $k$ of prime characteristic $p$, is an endo-permutation module (see~\cite{Pu1} or~\cite{Th}). L.
Mazza, Nadia
core +4 more sources
Primitive Permutation Groups with Primitive Jordan Sets
Journal of the London Mathematical Society, 1996 Let \(\Omega\) be a set and \(G\) a group of permutations of \(\Omega\). A subset \(\Sigma\) of \(\Omega\) is said to be a Jordan set (for \(G\) in \(\Omega\)) if \(|\Sigma|>1\) and there is a subgroup \(H\) of \(G\) that is transitive on \(\Sigma\) and fixes the complement \(\Omega\setminus\Sigma\) pointwise.
Adeleke, SA, Neumann, P
openaire +1 more source
2-closures of primitive permutation groups of holomorph type
Open Mathematics, 2019 The 2-closure G(2) of a permutation group G on a finite set Ω is the largest subgroup of Sym(Ω) which has the same orbits as G in the induced action on Ω × Ω.
Yu Xue, Pan Jiangmin
doaj +1 more source
PRIMITIVE PERMUTATION GROUPS CONTAINING A CYCLE [PDF]
Bulletin of the Australian Mathematical Society, 2013 AbstractThe primitive finite permutation groups containing a cycle are classified. Of these, only the alternating and symmetric groups contain a cycle fixing at least three points. This removes a primality condition from a classical theorem of Jordan. Some applications to monodromy groups are given, and the contributions of Jordan and Marggraff to this
openaire +2 more sources
Most switching classes with primitive automorphism groups contain graphs with trivial groups [PDF]
, 2015 The operation of switching a graph Gamma with respect to a subset X of the vertex set interchanges edges and non-edges between X and its complement, leaving the rest of the graph unchanged.
Cameron, Peter Jephson, Spiga, Pablo
core +2 more sources
Properties of triple error orbits G and their invariants in Bose – Chaudhuri – Hocquenghem codes C7
Весці Нацыянальнай акадэміі навук Беларусі: Серыя фізіка-тэхнічных навук, 2019 This work is the further development of the theory of norms of syndromes: the theory of polynomial invariants of G-orbits of errors expands with the group G of automorphisms of binary cyclic BCH codes obtained by joining the degrees of cyclotomic ...
V. A. Lipnitski, A. U. Serada
doaj +1 more source
Pre-primitive permutation groups
Journal of Algebra, 2023 A transitive permutation group $G$ on a finite set $Ω$ is said to be pre-primitive if every $G$-invariant partition of $Ω$ is the orbit partition of a subgroup of $G$. It follows that pre-primitivity and quasiprimitivity are logically independent (there are groups satisfying one but not the other) and their conjunction is equivalent to primitivity ...
Marina Anagnostopoulou-Merkouri +2 more
openaire +4 more sources