Documentation

permutation-bimodules
- Permutation Bimodules (MODULES OVER AN ALGEBRA AND GROUP REPRESENTATIONS)
permutation-modules
- Permutation Modules (MODULES OVER AN ALGEBRA AND GROUP REPRESENTATIONS)
permutation-polynomials
- Permutation Polynomials (FINITE FIELDS)
- Permutation Polynomials (UNIVARIATE POLYNOMIAL RINGS)
permutation_decode
- Permutation Decoding (LINEAR CODES OVER FINITE FIELDS)
PermutationActionD8
- AlgFP_PermutationActionD8 (Example H89E9)
PermutationAutomorphism
- Automorphism(A, g) : Sch, GrpPermElt -> MapIsoSch
- PermutationAutomorphism(A, g) : Sch,GrpPermElt -> MapIsoSch
PermutationBimodule
- PermutationBimodule(G,H,m,K): Grp, Grp, Map, Fld -> LRModGrp
PermutationCharacter
- PermutationCharacter(K) : FldNum -> ArtRep
- PermutationCharacter(F,K) : FldPad,FldPad -> GalRep
- PermutationCharacter(G, H) : Grp, Grp -> AlgChtrElt
- PermutationCharacter(G, H) : GrpFin, GrpFin -> AlgChtrElt
- PermutationCharacter(G, H) : GrpMat, GrpMat -> AlgChtrElt
- PermutationCharacter(G) : GrpPerm -> AlgChtrElt
- PermutationCharacter(G) : GrpPerm -> AlgChtrElt
- PermutationCharacter(G) : GrpPerm -> AlgChtrElt
- PermutationCharacter(G, H) : GrpPerm, GrpPerm -> AlgChtrElt
PermutationCode
- PermutationCode(u, G) : ModTupRngElt, GrpPerm -> Code
- PermutationCode(u, G) : ModTupRngElt, GrpPerm -> Code
- CodeFld_PermutationCode (Example H161E3)
- CodeRng_PermutationCode (Example H164E3)
PermutationDecode
- PermutationDecode(C, I, S, s, u) : CodeLinFld, [RngIntElt], [AlgMatElt], RngIntElt, ModTupFldElt -> BoolElt, ModTupFldElt
- PermutationDecode(C, I, S, s, Q) : CodeLinFld, [RngIntElt], [AlgMatElt], RngIntElt, [ModTupFldElt] -> [BoolElt], [ModTupFldElt]
- PermutationDecode(C, I, S, s, u) : CodeLinRng, [RngIntElt], [GrpPermElt], RngIntElt, ModTupFldElt -> BoolElt, ModTupRngElt, ModTupFldElt
- PermutationDecode(C, I, S, s, Q) : CodeLinRng, [RngIntElt], [GrpPermElt], RngIntElt, [ModTupFldElt] -> [BoolElt], [ModTupRngElt], [ModTupFldElt]
PermutationGroup
- PermutationGroup(C) : Code -> GrpPerm, PowMap, Map
- PermutationGroup(C) : CodeAdd -> GrpPerm
- PermutationGroup(C) : CodeLinRng -> GrpPerm
- PermutationGroup(Q) : CodeQuantum -> GrpPerm
- PermutationGroup(K) : DBAtlasKeyPermRep -> GrpPerm
- PermutationGroup(A) : GrpAb -> GrpPerm, Hom(Grp)
- PermutationGroup(A) : GrpAutCrv -> GrpPerm
- PermutationGroup(A) : GrpAuto -> GrpPerm
- PermutationGroup(G) : GrpFP -> GrpPerm, GrpHom
- PermutationGroup(D, i: parameters): DB, RngIntElt -> GrpPerm
- PermutationGroup< n | L > : RngIntElt, List -> GrpPerm
- PermutationGroup< X | L > : Set, List -> GrpPerm
- PermutationGroup< X | L > : Set, List -> GrpPerm, Hom
PermutationGroupExtendedPerfectCodeZ4
- PAutExtendedPerfectCodeZ4(δ, m) : RngIntElt, RngIntElt -> GrpPerm, Mtrx
- PermutationGroupExtendedPerfectCodeZ4(δ, m) : RngIntElt, RngIntElt -> GrpPerm, Mtrx
PermutationGroupExtendedPerfectCodeZ4Order
- PAutExtendedPerfectCodeZ4Order(δ, m) : RngIntElt, RngIntElt -> RngIntElt
- PermutationGroupExtendedPerfectCodeZ4Order(δ, m) : RngIntElt, RngIntElt -> RngIntElt
PermutationGroupGrayMapImage
- PermutationGroupGrayMapImage(C) : CodeLinRng -> GrpPerm
PermutationGroupHadamardCodeZ4
- PAutHadamardCodeZ4(δ, m) : RngIntElt, RngIntElt -> GrpPerm, Mtrx
- PermutationGroupHadamardCodeZ4(δ, m) : RngIntElt, RngIntElt -> GrpPerm, Mtrx
PermutationGroupHadamardCodeZ4Order
- PAutHadamardCodeZ4Order(δ, m) : RngIntElt, RngIntElt -> RngIntElt
- PermutationGroupHadamardCodeZ4Order(δ, m) : RngIntElt, RngIntElt -> RngIntElt
PermutationMatrix
- PermutationMatrix(R, x) : Rng, GrpPermElt -> Mtrx
- PermutationMatrix(R, Q) : Rng, [ RngIntElt ] -> Mtrx
PermutationModule
- PermutationModule(G, K) : Grp, Fld -> ModGrp
- PermutationModule(G, H, K) : Grp, Grp, Fld -> ModGrp
- PermutationModule(G, H, R) : Grp, Grp, Rng -> ModGrp
- PermutationModule(G, V) : Grp, ModTupFld -> ModGrp
- PermutationModule(G, u) : Grp, ModTupFldElt -> ModGrp
- PermutationModule(G, H, R) : GrpFin, GrpFin, Rng -> ModGrpFin
- PermutationModule(G, H, R) : GrpMat, GrpMat, Rng -> ModGrp
- PermutationModule(G, R) : GrpPerm, Rng -> ModGrp
- PermutationModule(G, R) : GrpPerm, Rng -> ModGrpFin
PermutationRepresentation
- PermutationRepresentation(A) : GrpAutCrv -> GrpPerm, Map
- PermutationRepresentation(A) : GrpAuto -> Map, GrpPerm, SetIndx
- PermutationRepresentation(D, i: parameters): DB, RngIntElt -> Hom(Grp), GrpFP, GrpPerm
Permutations
- NumberOfPermutations(n, k) : RngIntElt, RngIntElt -> RngIntElt
- Permutations(S) : SetEnum -> SetEnum;
- Permutations(S) : SetEnum -> SetEnum;
- Permutations(S, k) : SetEnum, RngIntElt -> SetEnum;
- Permutations(S, k) : SetEnum, RngIntElt -> SetEnum;
- ReflectionPermutations(W) : GrpMat -> []
- ReflectionPermutations(R) : RootDtm -> []
- ReflectionPermutations(R) : RootSys -> []
- SimpleReflectionPermutations(W) : GrpMat -> []
- SimpleReflectionPermutations(W) : GrpPermCox -> [GrpPermElt]
- SimpleReflectionPermutations(R) : RootDtm -> []
- SimpleReflectionPermutations(R) : RootSys -> []
- TensorInducedPermutations(G) : GrpMat -> SeqEnum
- GrpPerm_Permutations (Example H64E2)
permutations
- Permutations (PERMUTATION GROUPS)
PermutationSupport
- PermutationSupport(A) : GrpAuto -> SetIndx
Permute
- PermuteWeights(D, pi, S) : LieRepDec, GrpPermElt, RootDtm -> LieRepDec
permute
- Minimal Forms and Gradings (BASIC ALGEBRAS)

V2.28, 13 July 2023

Magma is maintained and distributed by the Computational Algebra Group, School of Mathematics and Statistics, University of Sydney.