# pair group

Is there a way to implement the "pair group" in sage like there is in mathematica?

pair group

Is there a way to implement the "pair group" in sage like there is in mathematica?

Asked: **
2013-11-21 13:36:52 -0500
**

Seen: **107 times**

Last updated: **Nov 21 '13**

Orbits on group actions acting on sets

Multivariable equation in multiplicative group Z_p

Constructing subgroups by intersection

Direct product of $S_n$ and $\mathbb Z_m$

Solving two-variable equations mod p

Iterator for conjugacy classes of Sn

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.

Can you provide a definition of a pair group? (I looked at the link, but I don't know what "p" is.)

In this case, p is the number of letters in the symmetric group. So, S_p is the pth symmetric group.

I'm reading the first sentence of Wolfram's definition: if `G` is a group, what's `p`? Or does the pair group depend on both `G` and `p` independently? Or does `G` come with an embedding into a specific symmetric group?

In this case, G=S_p. In any case, if G is finite, then it is (isomorphic to) a subgroup of S_p for some suitably chosen p (Cayley's Theorem). The pair group only depends on G. However, the interesting and important case is when we use the full symmetric group for G.

I know Cayley's theorem, but my point is that there is no unique `p` so that `G` is a subgroup of `S_p`. (Plus the cited definition doesn't even insist that the group is finite. Their first sentence is extremely sloppy; I wouldn't let my algebra students get away with it.) So the precise description of the pair group (in terms of which permutations in contains) will definitely depend on the choice of embedding of `G` into `S_p`. Different embeddings should lead to different, but (I'm willing to believe) isomorphic, groups.