PermutationSetRepresentation

class fuse.groups.PermutationSetRepresentation(perm_list, cell=None, name=None)

Bases: object

A representation of a set of permutations (can be a full group) on a cell.

Args:

[permutations]: the list of permutations in the set cell (optional): the cell the group is representing the operations on

__init__(perm_list, cell=None, name=None)

Methods

__init__(perm_list[, cell, name])

add_cell(cell)

compute_num_reps([base_val])

Compute the numerical represention of each member as compared to the identity.

conjugacy_class(g)

cosets(subset)

cosets_by_submember(subset)

decompose(x, H)

Write x = a o h with a in this transversal and h in H.

dict_id()

get_member(perm)

get_member_by_val(val)

is_left_transversal(A, H)

Whether A is a left transversal of the subgroup H.

is_subgroup(H)

Whether H, a set of members of this group, is a subgroup of it.

members([perm])

size()

span_representation(act[, tol])

The matrices of the action on the span of act(identity).

span_stabiliser(act[, tol])

The members s with span(act(s)) == span(act(identity)).

compute_num_reps(base_val=0)

Compute the numerical represention of each member as compared to the identity. Where the numerical rep is:

M.index(id[0]) = a; M.remove(id[0]) M.index(id[1]) = b; M.remove(id[1]) M.index(id[2]) = c; M.remove(id[2])

o = (a * 2!) + (b * 1!) + (c * 0!)

decompose(x, H)

Write x = a o h with a in this transversal and h in H.

This set must be a left transversal of the subgroup H of the group containing x; the decomposition is then unique. Returns (a, h) as members of that group: a represents the coset of x.

is_left_transversal(A, H)

Whether A is a left transversal of the subgroup H.

Every member of this group is a o h for exactly one a in A and h in H.

is_subgroup(H)

Whether H, a set of members of this group, is a subgroup of it.

span_representation(act, tol=1e-08)

The matrices of the action on the span of act(identity).

For each member s returns rho(s) with act(s)[i] = sum_j rho(s)[j, i] * act(identity)[j]. The rows of act(identity) must be linearly independent and every member must preserve their span (as for the members of span_stabiliser()). Returns {permutation array form: rho(s)}.

span_stabiliser(act, tol=1e-10)

The members s with span(act(s)) == span(act(identity)).

act(s) returns an (m, n) array whose rows are the images under s of m vectors (for example linear functionals evaluated on a basis), all in one fixed coordinate system. Returns a permutation set on this group’s cell.