PermutationProduct
The product of permutations, applying the left factor first. .
✓ checked against that system · ! checked, with disagreements (hover a chip)Wolfram Language
PermutationProduct✓PermutationProduct(p, q, ...)the permutation that applies p, then q, and so onSageMath
enumeratio_permutation_product(p, q, ...)Typed signatures
| Type | Package | Applies |
|---|---|---|
((expression<Cycles> | list<integer> | permutation)*) -> expression<Cycles> | list<integer> | permutation | combinatoricsreplaces groupalgebra | always |
((expression<Cycles> | list<integer>)*) -> expression<Cycles> | list<integer> | groupalgebra | always |
Details
- Either notation, as Permute and InversePermutation read them: a one-line word
{v1, ..., vn}or Cycles, or aPermutation - The result is Cycles when any argument is, else a one-line word (a
Permutationwhen given one); shorter words are padded with fixed points - Wolfram multiplies left to right, so
PermutationProduct(p, q)is not ; it is - With no arguments it is the identity,
Cycles({})
Examples
Scope #
Permutation values give a Permutation
live ↗InOut
Known value · wolframscript 15.0, on the one-line word
the smaller degree is padded with fixed points
live ↗InOut
Known value · wolframscript 15.0, on the one-line word
any Cycles argument makes the result Cycles
live ↗InOut
Known value · wolframscript 15.0, on the one-line word
About
| Examples | 10 |
|---|---|
| Checked against | Wolfram Language 10 agreeSageMath 9 agree |
| Crosswalk | Wolfram LanguageSageMath ×2 |
Implementation
mapped
sagepackages/oracle/src/mappings.tsSage multiplies left to right by default, applying the left factor first, as Wolfram and ours do.
mapped
sagepackages/oracle/src/mappings.ts See also: PermutationPower, InversePermutation, Permute