scholarly journals Note on a paper of Tsuzuku

1964 ◽  
Vol 6 (4) ◽  
pp. 196-197
Author(s):  
H. K. Farahat
Keyword(s):  
Symmetric Group ◽  
Commutative Ring ◽  
Permutation Group ◽  
Matrix Representation ◽  
Invertible Element ◽  
Unit Element ◽  
Transitive Permutation Group ◽  
Natural Representation ◽  
Correct Proof ◽  
Permutation Matrices

In [2], Tosiro Tsuzzuku gave a proof of the following:THEOREM. Let G be a doubly transitive permutation group of degree n, let K be any commutative ring with unit element and let p be the natural representation of G by n × n permutation matrices with elements 0, 1 in K. Then ρ is decomposable as a matrix representation over K if and only ifn is an invertible element of K.For G the symmetric group this result follows from Theorems (2.1) and (4.12) of [1]. The proof given by Tsuzuku is unsatisfactory, although it is perfectly valid when K is a field. The purpose of this note is to give a correct proof of the general case.

scholarly journals On the natural representation of the symmetric groups

1962 ◽  
Vol 5 (3) ◽  
pp. 121-136 ◽  
Author(s):  
H. K. Farahat
Keyword(s):  
Finite Number ◽  
Symmetric Group ◽  
Commutative Ring ◽  
Group Algebra ◽  
Symmetric Groups ◽  
Unit Element ◽  
Natural Representation ◽  
Image Position ◽  
Obvious Manner

Let E be an arbitrary (non-empty) set and S the restricted symmetric group on E, that is the group of all permutations of E which keep all but a finite number of elements of E fixed. If Φ is any commutative ring with unit element, let Γ = Φ(S) be the group algebra of S over Φ,Γ ⊃ Φ and let M be the free Φ-module having E as Φ-base. The “natural” representation of S is obtained by turning M into a Γ-module in the obvious manner, namely by writing for α∈S, λ1∈Φ,

A theorem on transitive groups

1933 ◽  
Vol 29 (2) ◽  
pp. 257-259
Author(s):  
Garrett Birkhoff
Keyword(s):  
Symmetric Group ◽  
Permutation Group ◽  
Transitive Permutation Group ◽  
Transitive Groups

Let be any transitive permutation group on the n symbols 1, …, n. Let be the subgroup of whose elements leave i fixed. Let ′ be the normalizer of , i.e., the subgroup of the symmetric group on 1, …, n transforming into itself. Let G′, G′1, G′2, etc., denote elements of ′. Finally, let ″ be the centralizer of , i.e., the subgroup in transforming every element of into itself.

On transitive permutation groups with a subgroup satisfying a certain conjugacy condition

1984 ◽  
Vol 36 (1) ◽  
pp. 69-86 ◽  
Author(s):  
Cheryl E. Praeger
Keyword(s):  
Permutation Group ◽  
Permutation Groups ◽  
Transitive Permutation Group ◽  
Pronormal Subgroup ◽  
Natural Representation ◽  
Conjugacy Condition ◽  
Sylow Subgroups ◽  
Point Stabilizer

AbstractLet G be transitive permutation group of degree n and let K be a nontrivial pronormal subgroup of G (that is, for all g in G, K and Kg are conjugate in (K, Kg)). It is shown that K can fix at most ½(n – 1) points. Moreover if K fixes exactly ½(n – 1) points then G is either An or Sn, or GL(d, 2) in its natural representation where n = 2d-1 ≥ 7. Connections with a result of Michael O'Nan are dicussed, and an application to the Sylow subgroups of a one point stabilizer is given.

Metacyclic Invariants of Knots and Links

1970 ◽  
Vol 22 (2) ◽  
pp. 193-201 ◽  
Author(s):  
R. H. Fox
Keyword(s):  
Symmetric Group ◽  
Permutation Group ◽  
Equivalence Class ◽  
Base Point ◽  
Covering Space ◽  
Transitive Permutation Group ◽  
Oriented Link ◽  
Inner Automorphism ◽  
Knots And Links

To each representation ρ on a transitive permutation group P of the group G = π(S – k) of an (ordered and oriented) link k = k1 ∪ k2 ∪ … ∪ kμ in the oriented 3-sphere S there is associated an oriented open 3-manifold M = Mρ(k), the covering space of S – k that belongs to ρ. The points 01, 02, … that lie over the base point o may be indexed in such a way that the elements g of G into which the paths from oi to oj project are represented by the permutations gρ of the form , and this property characterizes M. Of course M does not depend on the actual indices assigned to the points o1, o2, … but only on the equivalence class of ρ, where two representations ρ of G onto P and ρ′ of G onto P′ are equivalent when there is an inner automorphism θ of some symmetric group in which both P and P′ are contained which is such that ρ′ = θρ.

scholarly journals On induced permutation matrices and the symmetric group

1936 ◽  
Vol 5 (1) ◽  
pp. 1-13 ◽  
Author(s):  
A. C. Aitken
Keyword(s):  
Symmetric Group ◽  
Matrix Representation ◽  
Zero Element ◽  
Natural Order ◽  
Third Order ◽  
The Third ◽  
Permutation Matrices ◽  
The Matrix ◽  
Matrix Relation ◽  
Image Position

The n! operations Ai of permutations upon n different ordered symbols correspond to n! matrices Ai of the nth order, which have in each row and in each column only one non-zero element, namely a unit. Such matrices Ai are called permutation matrices, since their effect in premultiplying an arbitrary column vector x = {x1x2….xn} is to impress the permutation Ai upon the elements xi. For example the six matrices of the third orderare permutation matrices. It is convenient to denote them bywhere the bracketed indices refer to the permutations of natural order. Clearly the relation Ai Aj = Ak entails the matrix relation AiAj = Ak; in other words, the n! matrices Ai, give a matrix representation of the symmetric group of order n!.

Unitary Representations of Generalized Symmetric Groups

1969 ◽  
Vol 21 ◽  
pp. 28-38 ◽  
Author(s):  
B. M. Puttaswamaiah
Keyword(s):  
Normal Subgroup ◽  
Symmetric Group ◽  
Permutation Group ◽  
Direct Product ◽  
Cyclic Group ◽  
Symmetric Groups ◽  
Unitary Representations ◽  
Complex Field ◽  
Permutation Matrices ◽  
Image Position

In this paper all representations are over the complex field K. The generalized symmetric group S(n, m) of order n!mn is isomorphic to the semi-direct product of the group of n × n diagonal matrices whose rath powers are the unit matrix by the group of all n × n permutation matrices over K. As a permutation group, S(n, m) consists of all permutations of the mn symbols {1, 2, …, mn} which commute withObviously, S (1, m) is a cyclic group of order m, while S(n, 1) is the symmetric group of order n!. If ci = (i, n+ i, …, (m – 1)n+ i) andthen {c1, c2, …, cn} generate a normal subgroup Q(n) of order mn and {s1, s2, …, sn…1} generate a subgroup S(n) isomorphic to S(n, 1).

Some generalized characters associated to a transitive permutation group

2020 ◽  
Vol 23 (3) ◽  
pp. 393-397
Author(s):  
Wolfgang Knapp ◽  
Peter Schmid
Keyword(s):  
Positive Integer ◽  
Permutation Group ◽  
Frobenius Group ◽  
Sufficient Conditions ◽  
Necessary Condition ◽  
Transitive Permutation Group ◽  
Point Stabilizer ◽  
Necessary And Sufficient ◽  
Regular Character ◽  
Permutation Character

AbstractLet G be a finite transitive permutation group of degree n, with point stabilizer {H\neq 1} and permutation character π. For every positive integer t, we consider the generalized character {\psi_{t}=\rho_{G}-t(\pi-1_{G})}, where {\rho_{G}} is the regular character of G and {1_{G}} the 1-character. We give necessary and sufficient conditions on t (and G) which guarantee that {\psi_{t}} is a character of G. A necessary condition is that {t\leq\min\{n-1,\lvert H\rvert\}}, and it turns out that {\psi_{t}} is a character of G for {t=n-1} resp. {t=\lvert H\rvert} precisely when G is 2-transitive resp. a Frobenius group.

On a conjecture of Hughes

1967 ◽  
Vol 63 (3) ◽  
pp. 647-652 ◽  
Author(s):  
Judita Cofman
Keyword(s):  
Projective Plane ◽  
Permutation Group ◽  
Translation Plane ◽  
Collineation Group ◽  
Affine Plane ◽  
Finite Projective Plane ◽  
Transitive Permutation Group ◽  
Condition C

D. R. Hughes stated the following conjecture: If π is a finite projective plane satisfying the condition: (C)π contains a collineation group δ inducing a doubly transitive permutation group δ* on the points of a line g, fixed under δ, then the corresponding affine plane πg is a translation plane.

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.

Completely Indecomposable Modules

1949 ◽  
Vol 1 (2) ◽  
pp. 125-152 ◽  
Author(s):  
Ernst Snapper
Keyword(s):  
Abelian Group ◽  
Commutative Ring ◽  
Chain Condition ◽  
Indecomposable Module ◽  
Unit Element ◽  
Indecomposable Modules ◽  
Operator Domain ◽  
Unit Operator ◽  
Ascending Chain Condition

The purpose of this paper is to investigate completely indecomposable modules. A completely indecomposable module is an additive abelian group with a ring A as operator domain, where the following four conditions are satisfied.1-1. A is a commutative ring and has a unit element which is unit operator for .1-2. The submodules of satisfy the ascending chain condition. (Submodule will always mean invariant submodule.)

Sign in / Sign up

Export Citation Format

Share Document