Re: groups



In article <32f8fdc6-3c0a-49f1-8d21-c9dc27fc3a95@xxxxxxxxxxxxxxxxxxxxxxxxxxx>,
<judysisley@xxxxxxxxx> wrote:
Can somebody describe the structure of C(A_4) and C(D_6) group of
order 12?

Yes.

You probably can too, if you think about it. You are looking for the
centers. What permutations of 4 letters commute with EVERY
permutation of 4 letters? You can use the fact that they must commute
with each transposition, and that (a,b)sigma = sigma(a,b) is the same
as (a,b)sigma(a,b) = sigma. This in turn means that if you write sigma
as a product of disjoint cycles, and then you replace every a by b and
every b by a in that expression, you will just get another way to
write sigma. From there, it should be easy.

As for the center of the dihedral group of 12 elements, an element
r^i*s^j, with 0 <= i <= 5 and 0 <= j <= 1 is in the center if and only
if it commutes with both r and s (r represents the rotation, s the
reflection). Since sr = r^{-1}s, when j=0 consider what happens when
you take sr^i and r^is; and when j=1 consider what happens when you
take r(r^is) and (r^is)r.

--
======================================================================
"It's not denial. I'm just very selective about
what I accept as reality."
--- Calvin ("Calvin and Hobbes" by Bill Watterson)
======================================================================

Arturo Magidin
magidin-at-member-ams-org

.



Relevant Pages

  • Re: Public-Key Key Exchange based on Parameterized Permutations
    ... composite commutative parameterized permutations. ... in parallel using virtual commutative involution pairs. ... Non-overlapping multiple bit fields for which parameters are the amount ... >> You cannot assume that any or all of the Pxi commute with Pbi. ...
    (sci.crypt)
  • Re: some questions about permutation
    ... I have said in former statement that two permutations have the same ... choosen RSA permutations could have the same range and domain? ... Choosing a random RSA trapdoor permutation ... I would think two such RSA keypairs would be highly unlikely to commute, although offhand I don't see a proof that finding an that commuted with an whose d is unknown would allow calculating m**d mod N for arbitrary m. ...
    (sci.crypt)
  • Re: A new public key algorithm based on avalanche properties
    ... ]> Excuse the ignorance but as far as I know it is not generally true that ... there are loads of permutations which communte. ... g is a permuation of the rest of the elements, then f and g commute. ...
    (sci.crypt)

Quantcast