Results 1 to 10 of about 93,111 (137)

Permutation Groups Generated by γ-Cycles

open access: yesAxioms, 2022
A γ-cycle is a cycle of the form (i+1,i+2,…,i+m) in the symmetric group Sn. We study the subgroups of Sn generated by several sets of γ-cycles. Our mathematical development is strongly supported by computational experiments and proofs based on do-it ...
Răzvan Diaconescu
doaj   +1 more source

Permutation Polytopes of Cyclic Groups [PDF]

open access: yesDiscrete 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

The character table of a sharply 5-transitive subgroup of the alternating group of degree 12 [PDF]

open access: yesInternational Journal of Group Theory, 2021
We calculate the character table of a sharply $5$-transitive subgroup of $\alter(12)$‎, ‎and of a sharply $4$-transitive subgroup of $\alter(11)$‎. ‎Our presentation of these calculations is new because we make no reference to the sporadic simple Mathieu
Nick Gill, Sam Hughes
doaj   +1 more source

Computing permutation groups of error-correcting codes

open access: yesLietuvos Matematikos Rinkinys, 2000
There is not abstract.
Gintaras Skersys
doaj   +3 more sources

Rational and quasi-permutation representations of holomorphs of cyclic $p$-groups [PDF]

open access: yesInternational Journal of Group Theory, 2022
‎For a finite group $G$‎, ‎three of the positive integers governing its‎ ‎representation theory over $\mathbb{C}$ and over $\mathbb{Q}$ are‎ ‎$p(G),q(G),c(G)$‎.
Soham Pradhan, B. Sury
doaj   +1 more source

Magic informationally complete POVMs with permutations [PDF]

open access: yesRoyal Society Open Science, 2017
Eigenstates of permutation gates are either stabilizer states (for gates in the Pauli group) or magic states, thus allowing universal quantum computation (Planat, Rukhsan-Ul-Haq 2017 Adv. Math. Phys. 2017, 5287862 (doi:10.1155/2017/5287862)).
Michel Planat, Zafer Gedik
doaj   +1 more source

ON THE SPECTRUM OF DERANGEMENT GRAPHS OF ORDER A PRODUCT OF THREE PRIMES [PDF]

open access: yesJournal 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

Permutation codes over Sylow 2-subgroups $Syl_2(S_{2^n})$ of symmetric groups $S_{2^n}$

open access: yesResearches in Mathematics, 2021
The permutation code (or the code) is well known object of research starting from 1970s. The code and its properties is used in different algorithmic domains such as error-correction, computer search, etc.
V.A. Olshevska
doaj   +1 more source

ALGEBRAIC QUANTUM PERMUTATION GROUPS [PDF]

open access: yesAsian-European Journal of Mathematics, 2008
We discuss some algebraic aspects of quantum permutation groups, working over arbitrary fields. If 𝕂 is any characteristic zero field, we show that there exists a universal cosemisimple Hopf algebra coacting on the diagonal algebra 𝕂n: this is a refinement of Wang's universality theorem for the (compact) quantum permutation group.
openaire   +4 more sources

Solvable intransitive permutation groups with constant movement [PDF]

open access: yesJournal of Mahani Mathematical Research
In this paper, all solvable intransitive permutation groups with constant movement are classified and we show that they are one of the following groups: a cyclic $p$-group, an elementary abelian $p$-group, a Frobenius group of order 12 or a Frobenius ...
Mehdi Rezaei   +2 more
doaj   +1 more source

Home - About - Disclaimer - Privacy