# permutation representation

Dear all

Does sage support groups such as Frobenius groups or general affine group. How can I find the permutation representation of an arbitrary group.

Best regrad

permutation representation

Dear all

Does sage support groups such as Frobenius groups or general affine group. How can I find the permutation representation of an arbitrary group.

Best regrad

add a comment

0

There isn't a general construction of Frobenius groups in Sage currently, although there are many specific ones that can be constructed as members of other collections of groups, e.g. the symmetric group on 3 letters is a Frobenius group:

```
sage: G = SymmetricGroup(3)
```

Is it a Frobenius group? Let's check:

```
for g in G:
if not g.is_one():
fixed = [ x for x in [1..3] if g(x) == x ]
print "elt: ", g, "fixed set: ", fixed
```

returns:

```
elt: (2,3) fixed set: [1]
elt: (1,2) fixed set: [3]
elt: (1,2,3) fixed set: []
elt: (1,3,2) fixed set: []
elt: (1,3) fixed set: [2]
```

Yep.

I don't quite understand your second question. Any finite group can be embedded in a permutation group by its left or right action on itself. This is a basic theorem.

Asked: **
2013-01-27 00:29:16 -0600
**

Seen: **238 times**

Last updated: **Jan 27 '13**

A way of checking that a multivariate system of equations has a solution?

how to sum up the function over all permutations of variables in associative non-commutative algebra

substitution of ideal generators of a free algebra

algebra of differential operators

How to reorder terms in an expression to follow a specific order?

equation does not simplify due to fractional exponent

To give a name to an append list

Matrix multiplication of sparse matrix with matrix over polynomial ring

Copyright Sage, 2010. Some rights reserved under creative commons license. Content on this site is licensed under a Creative Commons Attribution Share Alike 3.0 license.