scholarly journals A Character Condition for Quadruple Transitivity

2011 ◽  
Vol 2011 ◽  
pp. 1-13
Author(s):  
S. Aldhafeeri ◽  
R. T. Curtis
Keyword(s):  
Symmetric Group ◽  
Permutation Group ◽  
Irreducible Character

Let be a permutation group of degree viewed as a subgroup of the symmetric group . We show that if the irreducible character of corresponding to the partition of into subsets of sizes and 2, that is, to say the character often denoted by , remains irreducible when restricted to , then = 4, 5 or 9 and , A5, or PΣL2(8), respectively, or is 4-transitive.

scholarly journals On Multiple Transitivity of Permutation Groups

1961 ◽  
Vol 18 ◽  
pp. 93-109 ◽  
Author(s):  
Tosiro Tsuzuku
Keyword(s):  
Symmetric Group ◽  
Permutation Group ◽  
Irreducible Character ◽  
Symmetric Groups ◽  
Transitive Group ◽  
Permutation Groups ◽  
Irreducible Characters ◽  
Interesting Theorem

It is well known that a doubly transitive group has an irreducible character χ1 such that χ1(R) = α(R) − 1 for any element R of and a quadruply transitive group has irreducible characters χ3 and χ3 such that χ2(R) = where α(R) and β(R) are respectively the numbers of one cycles and two cycles contained in R. G. Frobenius was led to this fact in the connection with characters of the symmetric groups and he proved the following interesting theorem: if a permutation group of degree n is t-ply transitive, then any irreducible character of the symmetric group of degree n with dimension at most equal to is an irreducible character of .

scholarly journals Groups fixing graphas in switching classes

1982 ◽  
Vol 33 (1) ◽  
pp. 76-85
Author(s):  
Martin W. Liebeck
Keyword(s):  
Finite Group ◽  
Symmetric Group ◽  
Permutation Group ◽  
Abelian Groups ◽  
Finite Set ◽  
A Finite Group ◽  
Switching Class

AbstractA permutation group G on a finite set Ω is always exposable if whenever G stabilises a switching class of graphs on Ω, G fixes a graph in the switching class. Here we consider the problem: given a finite group G, which permutation representations of G are always exposable? We present solutions to the problem for (i) 2-generator abelian groups, (ii) all abelian groups in semiregular representations. (iii) generalised quaternion groups and (iv) some representations of the symmetric group Sn.

Semilinear preservers of the immanants in the set of the doubly stochastic matrices

2017 ◽  
Vol 32 ◽  
pp. 76-97
Author(s):  
M. Antonia Duffner ◽  
Rosario Fernandes
Keyword(s):  
Symmetric Group ◽  
Real Number ◽  
Irreducible Character ◽  
Complex Field ◽  
Stochastic Matrices ◽  
Doubly Stochastic ◽  
Doubly Stochastic Matrices

Let $S_n$ denote the symmetric group of degree $n$ and $M_n$ denote the set of all $n$-by-$n$ matrices over the complex field, $\IC$. Let $\chi: S_n\rightarrow \IC$ be an irreducible character of degree greater than $1$ of $S_n$. The immanant $\dc: M_n \rightarrow \IC$ associated with $\chi$ is defined by $$ \dc(X) = \sum_{\sigma \in S_n} \chi(\sigma) \prod_{j=1}^n X_{j\sigma(j)} , \quad X = [X_{jk}] \in M_n. $$ Let $\Omega_n$ be the set of all $n$-by-$n$ doubly stochastic matrices, that is, matrices with nonnegative real entries and each row and column sum is one. We say that a map $T$ from $\Omega_n$ into $\Omega_n$ \begin{itemize} \item is semilinear if $T(\lambda S_1+(1-\lambda )S_2)=\lambda T(S_1)+(1-\lambda )T(S_2)$ for all $S_1,\ S_2\in \Omega_n$ and for all real number $\lambda$ such that $0\leq \lambda\leq 1$; \item preserves $d_{\chi }$ if $d_{\chi }(T(S))=d_{\chi }(S)$ for all $S\in\Omega_n$. \end{itemize} We characterize the semilinear surjective maps $T$ from $\Omega_n $ into $\Omega_n$ that preserve $\dc$, when the degree of $\chi$ is greater than one.

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.

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.

Supplements of bounded permutation groups

1998 ◽  
Vol 63 (1) ◽  
pp. 89-102 ◽  
Author(s):  
Stephen Bigelow
Keyword(s):  
Symmetric Group ◽  
Permutation Group ◽  
Permutation Groups ◽  
Cardinal Arithmetic

AbstractLet λ ≤ κ be infinite cardinals and let Ω be a set of cardinality κ. The bounded permutation group Bλ(Ω), or simply Bλ, is the group consisting of all permutations of Ω which move fewer than λ points in Ω. We say that a permutation group G acting on Ω is a supplement of Bλ if BλG is the full symmetric group on Ω.In [7], Macpherson and Neumann claimed to have classified all supplements of bounded permutation groups. Specifically, they claimed to have proved that a group G acting on the set Ω is a supplement of Bλ if and only if there exists Δ ⊂ Ω with ∣Δ∣ < λ such that the setwise stabiliser G{Δ} acts as the full symmetric group on Ω ∖ Δ. However I have found a mistake in their proof. The aim of this paper is to examine conditions under which Macpherson and Neumann's claim holds, as well as conditions under which a counterexample can be constructed. In the process we will discover surprising links with cardinal arithmetic and Shelah's recently developed pcf theory.

scholarly journals The combinatorics of an algebraic class of easy quantum groups

2014 ◽  
Vol 17 (03) ◽  
pp. 1450016 ◽  
Author(s):  
Sven Raum ◽  
Moritz Weber
Keyword(s):  
Symmetric Group ◽  
Quantum Group ◽  
Permutation Group ◽  
Free Product ◽  
Quantum Groups ◽  
Orthogonal Group ◽  
Point Of View ◽  
Algebraic Point ◽  
Matrix Quantum

Easy quantum groups are compact matrix quantum groups, whose intertwiner spaces are given by the combinatorics of categories of partitions. This class contains the symmetric group Sn and the orthogonal group On as well as Wang's quantum permutation group [Formula: see text] and his free orthogonal quantum group [Formula: see text]. In this paper, we study a particular class of categories of partitions to each of which we assign a subgroup of the infinite free product of the cyclic group of order two. This is an important step in the classification of all easy quantum groups and we deduce that there are uncountably many of them. We focus on the combinatorial aspects of this assignment, complementing the quantum algebraic point of view presented in another paper.

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 Optimization of Reversible Circuits Using Toffoli Decompositions with Negative Controls

Symmetry ◽  
2021 ◽  
Vol 13 (6) ◽  
pp. 1025
Author(s):  
Mariam Gado ◽  
Ahmed Younes
Keyword(s):  
Symmetric Group ◽  
Permutation Group ◽  
Building Blocks ◽  
Quantum Circuits ◽  
Quantum Computers ◽  
Quantum Cost ◽  
Reversible Circuits ◽  
Negative Controls ◽  
Target Qubit

The synthesis and optimization of quantum circuits are essential for the construction of quantum computers. This paper proposes two methods to reduce the quantum cost of 3-bit reversible circuits. The first method utilizes basic building blocks of gate pairs using different Toffoli decompositions. These gate pairs are used to reconstruct the quantum circuits where further optimization rules will be applied to synthesize the optimized circuit. The second method suggests using a new universal library, which provides better quantum cost when compared with previous work in both cost015 and cost115 metrics; this proposed new universal library “Negative NCT” uses gates that operate on the target qubit only when the control qubit’s state is zero. A combination of the proposed basic building blocks of pairs of gates and the proposed Negative NCT library is used in this work for synthesis and optimization, where the Negative NCT library showed better quantum cost after optimization compared with the NCT library despite having the same circuit size. The reversible circuits over three bits form a permutation group of size 40,320 (23!), which is a subset of the symmetric group, where the NCT library is considered as the generators of the permutation group.

scholarly journals Collineation group as a subgroup of the symmetric group

2013 ◽  
Vol 11 (1) ◽  
Author(s):  
Fedor Bogomolov ◽  
Marat Rovinsky
Keyword(s):  
Vector Space ◽  
Symmetric Group ◽  
Permutation Group ◽  
Collineation Group ◽  
Pointwise Convergence ◽  
London Math ◽  
Projective Group ◽  
Dimensional Vector ◽  
One Dimensional ◽  
Convergence Topology

AbstractLet ψ be the projectivization (i.e., the set of one-dimensional vector subspaces) of a vector space of dimension ≥ 3 over a field. Let H be a closed (in the pointwise convergence topology) subgroup of the permutation group $\mathfrak{S}_\psi $ of the set ψ. Suppose that H contains the projective group and an arbitrary self-bijection of ψ transforming a triple of collinear points to a non-collinear triple. It is well known from [Kantor W.M., McDonough T.P., On the maximality of PSL(d+1,q), d ≥ 2, J. London Math. Soc., 1974, 8(3), 426] that if ψ is finite then H contains the alternating subgroup $\mathfrak{A}_\psi $ of $\mathfrak{S}_\psi $. We show in Theorem 3.1 that H = $\mathfrak{S}_\psi $, if ψ is infinite.

Sign in / Sign up

Export Citation Format

Share Document