Results 31 to 40 of about 55,118 (252)
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
Primitive permutation groups and derangements of prime power order [PDF]
Manuscripta mathematica, 2015 Let G be a transitive permutation group on a finite set of size at least 2. By a well known theorem of Fein, Kantor and Schacher, G contains a derangement of prime power order.
Timothy C. Burness, H. Tong‐Viet
semanticscholar +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
On the Saxl graph of a permutation group [PDF]
Mathematical Proceedings of the Cambridge Philosophical Society, 2017 Let G be a permutation group on a set Ω. A subset of Ω is a base for G if its pointwise stabiliser in G is trivial. In this paper we introduce and study an associated graph Σ(G), which we call the Saxl graph of G. The vertices of Σ(G) are the points of Ω,
Timothy C. Burness, Michael Giudici
semanticscholar +1 more source
Primitive permutation groups satisfying the small orbit property and a problem of Bourgain and Kalai
Journal of Algebraic Combinatorics, 2018 We classify the primitive but not affine permutation subgroups of Sn\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek ...
Carmit Benbenisty
semanticscholar +2 more sources
Normalisers of primitive permutation groups in quasipolynomial time [PDF]
Bulletin of the London Mathematical Society, 2020 11 ...
Roney-Dougal, Colva Mary, Siccha, Sergio
openaire +3 more sources
Some Primitive Permutation Groups
Proceedings of the London Mathematical Society, 1985 Let \(\Omega\) be a countable infinite set. A subset \(\Sigma\) of \(\Omega\) is called a moiety iff \(\Sigma\) and \(\Omega\)-\(\Sigma\) are infinite. The following theorem is proved: If G is a primitive permutation group of \(\Omega\) that has no countable orbits on moieties, then G is 2-fold transitive. Furthermore, either G is highly transitive or \
openaire +2 more sources
Invariance groups of finite functions and orbit equivalence of permutation groups
Open Mathematics, 2015 Which subgroups of the symmetric group Sn arise as invariance groups of n-variable functions defined on a k-element domain? It appears that the higher the difference n-k, the more difficult it is to answer this question.
Horváth Eszter K. +3 more
doaj +1 more source
On the Socle of Finite Primitive Permutation Groups Having Frobenious Structure
Pure and Applied Mathematics JournalThe nilpotentcy class for the Frobenius was determined based on the structure theorem. The socle of the groups were observed to be regular normal and elementary abelian such features were the conditions for the nilpotency classes, as they were the basis ...
Danbaba Adamu, Momoh Sunday
semanticscholar +1 more source
On derangements in simple permutation groups
Forum of Mathematics, SigmaLet $G \leqslant \mathrm {Sym}(\Omega )$ be a finite transitive permutation group and recall that an element in G is a derangement if it has no fixed points on $\Omega $ . Let $\Delta (G)$ be the set of derangements in G and define
Timothy Burness, Marco Fusari
doaj +1 more source