Results 21 to 30 of about 329,666 (328)
On the Movement of a Permutation Group
Journal of Algebra, 1999 If \((G,\Omega)\) is a permutation group, then the movement \(\text{move}(G)\) is the supremum of \(\{|\Gamma^g\setminus\Gamma|:\Gamma\subseteq\Omega,\;g\in G\}\). If \(G\) has no fixed points, \(n:=|\Omega|\), and \(\text{move}(G)=m\) is finite, then \(n\leq 5m-2\), by a result of \textit{C. E. Praeger} [J. Algebra 144, No.
Neumann, P, Praeger, C
openaire +4 more sources
Trivial source bimodule rings for blocks and p-permutation equivalences [PDF]
, 2009 We associate with any p-block of a finite group a Grothendieck ring of certain p-permutation bimodules. We extend the notion of p-permutation equivalences introduced by Boltje and Xu [4] to source algebras of p-blocks of finite groups.
Linckelmann, M.
core +1 more source
3-Homogeneous Groups and Block-Transitive 7–(v, k, 3) Designs
Mathematical and Computational Applications, 2017 The classification of a block-transitive designs is an important subject on algebraic combinatorics. With the aid of MATLAB software, using the classification theorem of 3-homogeneous permutation groups, we look at the classification problem of block ...
Xiaolian Liao, Guohua Chen, Shangzhao Li
doaj +1 more source
The Fixity of Permutation Groups
Journal of Algebra, 1995 By definition, the fixity of a finite permutation group \(G\) is the maximal number of fixed points of a non-identity element of \(G\); so if \(f\) denotes the fixity of \(G\) and \(n\) the degree of \(G\) then \(n-f\) is the minimal degree of \(G\). The authors prove some general theorems on transitive permutation groups \(G\) with given fixity \(f>0\)
Jan Saxl, A. Shalev
openaire +3 more sources
On Abelian Permutation Groups [PDF]
Canadian Mathematical Bulletin, 1965 The principal object of this note is to determine the maximal order of Abelian subgroups of the symmetric group sn of degree n.
Leo Moser, R. Bercov
openaire +3 more sources
ON THE SPECTRUM OF DERANGEMENT GRAPHS OF ORDER A PRODUCT OF THREE PRIMES [PDF]
Journal of Algebraic Systems, 2019 A permutation with no fixed points is called a derangement. The subset $mathcal{D}$ of a permutation group is derangement if all elements of $mathcal{D}$ are derangement.
Modjtaba Ghorbani, Mina Rajabi-Parsa
doaj +1 more source
The Birkhoff theorem for unitary matrices of prime-power dimension [PDF]
, 2018 The unitary Birkhoff theorem states that any unitary matrix with all row sums and all column sums equal unity can be decomposed as a weighted sum of permutation matrices, such that both the sum of the weights and the sum of the squared moduli of the ...
De Baerdemacker, Stijn, De Vos, Alexis
core +3 more sources
Topology, 1997 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Richárd Rimányi +2 more
openaire +3 more sources
Novel Criteria for Deterministic Remote State Preparation via the Entangled Six-Qubit State
Entropy, 2016 In this paper, our concern is to design some criteria for deterministic remote state preparation for preparing an arbitrary three-particle state via a genuinely entangled six-qubit state.
Gang Xu +5 more
doaj +1 more source
Permutation Polytopes of Cyclic Groups [PDF]
Discrete Mathematics & Theoretical Computer Science, 2012 We investigate the combinatorics and geometry of permutation polytopes associated to cyclic permutation groups, i.e., the convex hulls of cyclic groups of permutation matrices.
Barbara Baumeister +3 more
doaj +1 more source