scholarly journals Set-Transitive Permutation Groups

1955 ◽  
Vol 7 ◽  
pp. 35-42 ◽  
Author(s):  
R. A. Beaumont ◽  
R. P. Peterson
Keyword(s):  
Permutation Group ◽  
Classical Theory ◽  
Turn Of The Century ◽  
Permutation Groups ◽  
Considerable Importance ◽  
Obvious Generalization ◽  
The Given

The concept of an s-ply transitive (1 ≤ s ≤ n) permutation group on n symbols is of considerable importance in the classical theory of finite permutation groups, which was in the height of its development in the period around the turn of the century. The obvious generalization to a permutation group which is s set-transitive (i.e., a group which, for each pair of s-element unordered subsets S, T of the given n symbols, contains a permutation which carries S into T) seems to have received little attention.

scholarly journals ON THE HEIGHT AND RELATIONAL COMPLEXITY OF A FINITE PERMUTATION GROUP

2021 ◽  
pp. 1-40
Author(s):  
NICK GILL ◽  
BIANCA LODÀ ◽  
PABLO SPIGA
Keyword(s):  
Permutation Group ◽  
Model Theory ◽  
Independent Set ◽  
Maximum Size ◽  
Proper Subset ◽  
Permutation Groups ◽  
Finite Permutation Group ◽  
Pointwise Stabilizer ◽  
Relational Complexity

Abstract Let G be a permutation group on a set $\Omega $ of size t. We say that $\Lambda \subseteq \Omega $ is an independent set if its pointwise stabilizer is not equal to the pointwise stabilizer of any proper subset of $\Lambda $ . We define the height of G to be the maximum size of an independent set, and we denote this quantity $\textrm{H}(G)$ . In this paper, we study $\textrm{H}(G)$ for the case when G is primitive. Our main result asserts that either $\textrm{H}(G)< 9\log t$ or else G is in a particular well-studied family (the primitive large–base groups). An immediate corollary of this result is a characterization of primitive permutation groups with large relational complexity, the latter quantity being a statistic introduced by Cherlin in his study of the model theory of permutation groups. We also study $\textrm{I}(G)$ , the maximum length of an irredundant base of G, in which case we prove that if G is primitive, then either $\textrm{I}(G)<7\log t$ or else, again, G is in a particular family (which includes the primitive large–base groups as well as some others).

scholarly journals Transversals in permutation groups and factorisations of complete graphs

2002 ◽  
Vol 65 (2) ◽  
pp. 277-288 ◽  
Author(s):  
Gil Kaplan ◽  
Arieh Lev
Keyword(s):  
Permutation Group ◽  
Directed Graph ◽  
Sufficient Conditions ◽  
Combinatorial Problems ◽  
Permutation Groups ◽  
Transitive Permutation Group ◽  
Complete Graphs ◽  
Frobenius Theorem ◽  
Disjoint Cycles ◽  
Finite Set

Let G be a transitive permutation group acting on a finite set of order n. We discuss certain types of transversals for a point stabiliser A in G: free transversals and global transversals. We give sufficient conditions for the existence of such transversals, and show the connection between these transversals and combinatorial problems of decomposing the complete directed graph into edge disjoint cycles. In particular, we classify all the inner-transitive Oberwolfach factorisations of the complete directed graph. We mention also a connection to Frobenius theorem.

scholarly journals Enumerating Finite Racks, Quandles and Kei

10.37236/3262 ◽  
2013 ◽  
Vol 20 (3) ◽  
Author(s):  
Simon R. Blackburn
Keyword(s):  
Permutation Group ◽  
Lower Bounds ◽  
Binary Operation ◽  
Independent Interest ◽  
Upper And Lower Bounds ◽  
Permutation Groups ◽  
Isomorphism Classes ◽  
Operator Group ◽  
The Relationship

A rack of order $n$ is a binary operation $\vartriangleright$ on a set $X$ of cardinality $n$, such that right multiplication is an automorphism. More precisely, $(X,\vartriangleright)$ is a rack provided that the map $x\mapsto x\vartriangleright y$ is a bijection for all $y\in X$, and $(x\vartriangleright y)\vartriangleright z=(x\vartriangleright z)\vartriangleright (y\vartriangleright z)$ for all $x,y,z\in X$.The paper provides upper and lower bounds of the form $2^{cn^2}$ on the number of isomorphism classes of racks of order $n$. Similar results on the number of isomorphism classes of quandles and kei are obtained. The results of the paper are established by first showing how an arbitrary rack is related to its operator group (the permutation group on $X$ generated by the maps $x\mapsto x\vartriangleright y$ for $y\in Y$), and then applying some of the theory of permutation groups. The relationship between a rack and its operator group extends results of Joyce and of Ryder; this relationship might be of independent interest.

Permutation groups and orbits on the power set

2019 ◽  
Vol 19 (12) ◽  
pp. 2150005
Author(s):  
Yong Yang
Keyword(s):  
Permutation Group ◽  
Permutation Groups ◽  
Power Set ◽  
Composition Factors

Let [Formula: see text] be a permutation group of degree [Formula: see text] and let [Formula: see text] denote the number of set-orbits of [Formula: see text]. We determine [Formula: see text] over all groups [Formula: see text] that satisfy certain restrictions on composition factors.

scholarly journals EMBEDDING PERMUTATION GROUPS INTO WREATH PRODUCTS IN PRODUCT ACTION

2012 ◽  
Vol 92 (1) ◽  
pp. 127-136 ◽  
Author(s):  
CHERYL E. PRAEGER ◽  
CSABA SCHNEIDER
Keyword(s):  
Permutation Group ◽  
Wreath Product ◽  
Automorphism Groups ◽  
Wreath Products ◽  
Error Correcting Codes ◽  
Permutation Groups ◽  
Graph Products ◽  
Product Action ◽  
Hamming Graphs

AbstractWe consider the wreath product of two permutation groups G≤Sym Γ and H≤Sym Δ as a permutation group acting on the set Π of functions from Δ to Γ. Such groups play an important role in the O’Nan–Scott theory of permutation groups and they also arise as automorphism groups of graph products and codes. Let X be a subgroup of Sym Γ≀Sym Δ. Our main result is that, in a suitable conjugate of X, the subgroup of SymΓ induced by a stabiliser of a coordinate δ∈Δ only depends on the orbit of δ under the induced action of X on Δ. Hence, if X is transitive on Δ, then X can be embedded into the wreath product of the permutation group induced by the stabiliser Xδ on Γ and the permutation group induced by X on Δ. We use this result to describe the case where X is intransitive on Δ and offer an application to error-correcting codes in Hamming graphs.

Intersections of Loci on an Algebraic V4

1937 ◽  
Vol 33 (4) ◽  
pp. 425-437 ◽  
Author(s):  
J. A. Todd
Keyword(s):  
Algebraic Geometry ◽  
Linear Space ◽  
Considerable Importance ◽  
Classical Paper ◽  
Residual Intersection ◽  
Pass Through ◽  
The Given

The problem of residual intersections is one of considerable importance in algebraic geometry. In its most general form the problem may be stated as follows. On a given variety V of d dimensions two varieties A and B, of respective dimensions k and k′, pass through a variety C whose dimension r is not less than r′ = k + k′ – d. It is required to determine the variety D of dimension r′ which forms the residual intersection of A and B. The classical paper on this subject is that of Severi*. He considers the case in which V is a linear space, and obtains a large variety of enumerative results connecting the characters of the residual intersection with those of the given loci.

scholarly journals Bounds on finite quasiprimitive permutation groups

2001 ◽  
Vol 71 (2) ◽  
pp. 243-258 ◽  
Author(s):  
Cheryl E. Praeger ◽  
Aner Shalev
Keyword(s):  
Normal Subgroup ◽  
Permutation Group ◽  
Minimum Degree ◽  
Permutation Groups ◽  
Primitive Permutation Group ◽  
Base Size ◽  
Nontrivial Normal Subgroup

AbstractA permutation group is said to be quasiprimitive if every nontrivial normal subgroup is transitive. Every primitive permutation group is quasiprimitive, but the converse is not true. In this paper we start a project whose goal is to check which of the classical results on finite primitive permutation groups also holds for quasiprimitive ones (possibly with some modifications). The main topics addressed here are bounds on order, minimum degree and base size, as well as groups containing special p-elements. We also pose some problems for further research.

MULTIPLE TRANSITIVITY AND MIN-WISE INDEPENDENCE IN PERMUTATION GROUPS

2004 ◽  
Vol 03 (04) ◽  
pp. 427-435
Author(s):  
C. FRANCHI
Keyword(s):  
Positive Integer ◽  
Permutation Group ◽  
Ordered Set ◽  
Permutation Groups ◽  
Linearly Ordered Set

Let Ω be a finite linearly ordered set and let k be a positive integer. A permutation group G on Ω is called co-k-restricted min-wise independent on Ω if [Formula: see text] for any X⊆Ω such that |X|≥|Ω|-k+1 and for any x∈X. We show that co-k-restricted min-wise independent groups are exactly the groups with the property that for each subset X⊆Ω with |X|≤k-1, the stabilizer G{X} of X in G is transitive on Ω\X. Using this fact, we determine all co-k-restricted min-wise independent groups.

scholarly journals On Primitive Extensions of Rank 3 of Symmetric Groups

1966 ◽  
Vol 27 (1) ◽  
pp. 171-177 ◽  
Author(s):  
Tosiro Tsuzuku
Keyword(s):  
Permutation Group ◽  
Symmetric Groups ◽  
Transitive Group ◽  
Permutation Groups ◽  
Minimal Set ◽  
Finite Set ◽  
Rank 2 ◽  
One To One

1. Let Ω be a finite set of arbitrary elements and let (G, Ω) be a permutation group on Ω. (This is also simply denoted by G). Two permutation groups (G, Ω) and (G, Γ) are called isomorphic if there exist an isomorphism σ of G onto H and a one to one mapping τ of Ω onto Γ such that (g(i))τ=gσ(iτ) for g ∊ G and i∊Ω. For a subset Δ of Ω, those elements of G which leave each point of Δ individually fixed form a subgroup GΔ of G which is called a stabilizer of Δ. A subset Γ of Ω is called an orbit of GΔ if Γ is a minimal set on which each element of G induces a permutation. A permutation group (G, Ω) is called a group of rank n if G is transitive on Ω and the number of orbits of a stabilizer Ga of a ∊ Ω, is n. A group of rank 2 is nothing but a doubly transitive group and there exist a few results on structure of groups of rank 3 (cf. H. Wielandt [6], D. G. Higman M).

scholarly journals On quasi-permutation representations of finite groups

1994 ◽  
Vol 36 (3) ◽  
pp. 301-308 ◽  
Author(s):  
J. M. Burns ◽  
B. Goldsmith ◽  
B. Hartley ◽  
R. Sandling
Keyword(s):  
Finite Group ◽  
Vector Space ◽  
Permutation Group ◽  
Minimal Degree ◽  
Permutation Representation ◽  
Permutation Groups ◽  
Complex Vector Space ◽  
Complex Vector ◽  
Group Situation ◽  
A Finite Group

In [6], Wong defined a quasi-permutation group of degree n to be a finite group G of automorphisms of an n-dimensional complex vector space such that every element of G has non-negative integral trace. The terminology derives from the fact that if G is a finite group of permutations of a set ω of size n, and we think of G as acting on the complex vector space with basis ω, then the trace of an element g ∈ G is equal to the number of points of ω fixed by g. In [6] and [7], Wong studied the extent to which some facts about permutation groups generalize to the quasi-permutation group situation. Here we investigate further the analogy between permutation groups and quasipermutation groups by studying the relation between the minimal degree of a faithful permutation representation of a given finite group G and the minimal degree of a faithful quasi-permutation representation. We shall often prefer to work over the rational field rather than the complex field.

Sign in / Sign up

Export Citation Format

Share Document