Previous Page Next Page Contents

Dom::PermutationGroup -- permutation groups

Introduction

Dom::PermutationGroup(n) creates the domain of all permutations of n elements.

Domain

Dom::PermutationGroup(n)

Parameters

n - positive integer

Details

Introduction

The domain element Dom::PermutationGroup(n)(l) represents the bijective mapping of the first n positive integers that maps the integer i to l[i], for 1 ≤i ≤n.

Creating Elements

Dom::PermutationGroup(n)(l)

Parameters

l - list or array consisting of the first n integers in some order.

Categories

Cat::Group

Related Domains

Dom::DihedralGroup

Entries

one

the identical mapping of the set {1, ..., n } to itself.

Method _mult: product of permutations

Method _invert: inverse of a permutation

Method func_call: function value of a permutation at a point

Method cycles: cycle representation of a permutation

Method order: order of a permutation

Method inversions: number of inversions

Method random: random permutation

Method convert: conversion of an object into a permutation

Method convert_to: conversion of a permutation into another type

Method expr: convert a permutation into a list

Example 1

Consider the group of permutations of the first seven positive integers:

>> G:=Dom::PermutationGroup(7)
                         Dom::PermutationGroup(7)

We enter an element by providing the image of 1, 2, etc. under the permutation.

>> a:=G([2,4,6,1,3,5,7])
                           [2, 4, 6, 1, 3, 5, 7]
>> a(3)
                                     6

Super-Domain

Dom::BaseDomain

Axioms

Ax::canonicalRep

Changes




Do you have questions or comments?


Copyright © SciFace Software GmbH & Co. KG 2000