Results 1 to 10 of about 12,641,387 (374)
Some of the next articles are maybe not open access.
Rank permutation group codes based on Kendall's correlation statistic
IEEE Transactions on Information Theory, 1969A coding scheme based on the properties of rank vectors is presented. The new codes are based on the theory of permutation groups by introducing a new notation for the group operation that simplifies the generation and decoding of desirable rank codes ...
H. Chadwick, L. Kurz
semanticscholar +1 more source
, 1979
Graphical methods of spin algebras are used to evaluate elements of the representation matrices of the spin permutation group for arbitrary transpositions. The matrix elements are evaluated directly; no matrix multiplication is required.
S. Wilson, J. Gerratt
semanticscholar +1 more source
Graphical methods of spin algebras are used to evaluate elements of the representation matrices of the spin permutation group for arbitrary transpositions. The matrix elements are evaluated directly; no matrix multiplication is required.
S. Wilson, J. Gerratt
semanticscholar +1 more source
, 2003
1. Introduction 2. Black-box groups 3. Permutation groups: a complexity overview 4. Bases and strong generating sets 5. Further low-level algorithms 6. A library of nearly linear time algorithms 7. Solvable permutation groups 8. Strong generating tests 9.
Á. Seress
semanticscholar +1 more source
1. Introduction 2. Black-box groups 3. Permutation groups: a complexity overview 4. Bases and strong generating sets 5. Further low-level algorithms 6. A library of nearly linear time algorithms 7. Solvable permutation groups 8. Strong generating tests 9.
Á. Seress
semanticscholar +1 more source
The Number of Cycles Associated with the Elements of a Permutation Group
, 1953Gontcharoff [1] has given several moment generating functions for the number of cycles associated with the elements of the permutation group on N symbols.
R. Greenwood
semanticscholar +1 more source
Clebsch-Gordan coefficients for the permutation group
, 1981A non-genealogical method is proposed for the reduction of the inner product representations of the permutation group SN. This method of determining the Clebsch-Gordan coefficients has been found to be recursive only within a given series.
G. G. Sahasrabudhe+2 more
semanticscholar +1 more source
On the relational complexity of a finite permutation group
, 2016G. Cherlin
semanticscholar +1 more source
Evolution; international journal of organic evolution, 2018
D. Adams, M. Collyer
semanticscholar +1 more source
D. Adams, M. Collyer
semanticscholar +1 more source
Designing secure substitution boxes based on permutation of symmetric group
Neural computing & applications (Print), 2019Amir Anees, Yi-Ping Phoebe Chen
semanticscholar +1 more source
Non-Uniform Bounds in the Random-Permutation, Ideal-Cipher, and Generic-Group Models
IACR Cryptology ePrint Archive, 2018Sandro Coretti, Y. Dodis, Siyao Guo
semanticscholar +1 more source