Results 211 to 220 of about 5,571,269 (248)

Competitive pre-ordering during planning persists in kinematically fused sequential movements

Wright-Wieckowski H, Friedman J, Galea JM, Kornysheva K.   +3 more
europepmc   +1 more source

Prime order derangements in primitive permutation groups [PDF]

Journal of Algebra, 2011
It is an easy exercise that any transitive permutation group \(G\) on a set \(\Omega\), \(|\Omega|\geq 2\), contains an element, which acts fixed point freely. These elements are called derangements. A much deeper result, using the classification of the finite simple groups, due to \textit{B. Fein}, \textit{W. M. Kantor} and \textit{M.
Timothy C Burness
exaly   +7 more sources

Primitive permutation groups with a regular subgroup [PDF]

Journal of Algebra, 2007
In the present paper all triples \((G,\Omega,X)\) are determined where \(G\) is a primitive permutation group acting on a finite set \(\Omega\) and containing a regular subgroup \(X\) in the case that the socle \(\text{soc}(G)\) of \(G\) is alternating, sporadic or an exceptional group of Lie type. Many further examples \((G,\Omega,X)\) are constructed
Barbara Baumeister
exaly   +4 more sources

On the degress of primitive permutation groups

Mathematische Zeitschrift, 1982
Peter Cameron
exaly   +3 more sources

On the point stabilizer in a primitive permutation group

Mathematische Zeitschrift, 1973
Wolfgang Knapp
exaly   +2 more sources

Some of the next articles are maybe not open access.

Related searches:

Permutation polynomials and primitive permutation groups

Archiv Der Mathematik, 1991
In 1966 L. Carlitz conjectured that for every even positive integer \(n\) there exists a constant \(c_ n\) such that for any odd \(q>c_ n\) there is no permutation polynomial of degree \(n\) over the finite field \(F_ q\) of order \(q\). This conjecture was known to hold for \(n\) a power of 2 and for all even \(n\leq 16\). In this paper the conjecture
Stephen D Cohen
exaly   +2 more sources

Primitive k-free permutation groups

Archiv Der Mathematik, 2007
For a finite permutation group G acting on a set Ω, we say that G is k-free if the set-wise stabilizer of every k-subset of Ω is trivial.
D Bundy
exaly   +2 more sources

On the orders of Primitive Permutation Groups

Bulletin of the London Mathematical Society, 1980
CHERYL E. PRAEGE R AN JAD N SAXLThe proble omf bounding the order of a permutation grou G ipn terms of itsdegree n was one of the central problem of 19tsh century group theory (see [4]) It.is closely relate to thde 1860 Grand Prix proble of them Pari s Academy but it, shistory goe isn fact much further back (see e.g an. [3]d [10]), [1] .
Praeger, Cheryl E., Saxl, Jan
openaire   +1 more source

On primitive overgroups of quasiprimitive permutation groups [PDF]

Journal of Algebra, 2003
A permutation group is said to be quasiprimitive if all its non-trivial normal subgroups are transitive. We investigate pairs (G,H) of permutation groups of degree n such that G⩽H⩽Sn with G quasiprimitive and H primitive.
Cheryl E Praeger
exaly   +2 more sources

Closures of Finite Primitive Permutation Groups

Bulletin of the London Mathematical Society, 1992
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Praeger, Cheryl E., Saxl, Jan
openaire   +2 more sources