GroupOrder
: how many elements a group has. Works over every carrier this package knows — CyclicGroup, DihedralGroup, GroupDirectProduct, SymmetricGroup, AlternatingGroup and PermutationGroup.
✓ checked against that system · ! checked, with disagreements (hover a chip)Wolfram Language
GroupOrder✓GroupOrder(group)the number of elements of groupSageMath
enumeratio_order(group)Oscarorder((group).G)Typed signatures
| Type | Package | Applies |
|---|---|---|
(expression<AlternatingGroup> | expression<CyclicGroup> | expression<DihedralGroup> | expression<GroupDirectProduct> | expression<PermutationGroup> | expression<SymmetricGroup> | indexed_collection) -> integer | groupalgebra | always |
Details
- For a
PermutationGroup, the order comes from a breadth-first closure over its generators, not a stored table GroupOrder(SymmetricGroup(n))is , andGroupOrder(AlternatingGroup(n))is , without materialising the permutations
Examples
Properties #
About
| Examples | 6 |
|---|---|
| Checked against | Wolfram Language 6 agreeSageMath 6 agreeOscar 1 agreeCombinatorica 1 differ |
| Crosswalk | Wolfram LanguageSageMathOscar |
Implementation
mapped
oscarpackages/oracle/src/mappings.tsmapped
sagepackages/oracle/src/mappings.ts See also: GroupElements, PermutationGroup, DihedralGroup, CyclicGroup, SymmetricGroup, AlternatingGroup