Group generated by Z_p and Z_q ?

  • Thread starter AlphaNumeric2
  • Start date
  • Tags
    Group
In summary, \mathbb{Z}_{p} and \mathbb{Z}_{q} are abelian within themselves as they each have only one generator, \omega_{p} and \omega_{q}, respectively. However, when combined, they are not always abelian. To generate all the elements in the group with generators \omega_{p} and \omega_{q}, one can use the action of these groups on a 6d torus. By considering the matrices of this action, all possible combinations of \omega_{p} and \omega_{q} can be computed up to length 5, resulting in 12 different matrices.
  • #1
AlphaNumeric2
42
2
[tex]\mathbb{Z}_{p}[/tex] and [tex]\mathbb{Z}_{q}[/tex] are (within themselves) abelian by the fact they each only have one generator, say [tex]\omega_{p}[/tex] and [tex]\omega_{q}[/tex]. However, when combined, they aren't (in general).

Is there a systematic way of generating all the different elements in the group with generators [tex]\omega_{p}[/tex] and [tex]\omega_{q}[/tex]? I'm currently only working with [tex]\mathbb{Z}_{2}[/tex] and [tex]\mathbb{Z}_{3}[/tex], but there's 12 elements in the group generated by both of them and if I do it in a combinatorical way I get huge amounts of the same elements in my end list.

Is there a way to stream line it a bit so that minimal repetition of the same elements occurs? Obviously I can do it by hand for my example (and I did) but I'm looking to automate it for groups up to [tex]\mathbb{Z}_{12}[/tex] and that'll be out of the question by hand and unless there's a nice way, computationally intensive.

Thanks for any help :)
 
Physics news on Phys.org
  • #2
How are you "combining" these two groups?
 
  • #3
I'm considering the action of these groups on a 6d torus so it comes down to saying a symmetry alters the 6 coordinates. Specifically :

[tex]\mathbb{Z}_{2} \quad \theta &:& (x^{1},y^{1},x^{2},y^{2},x^{3},y^{3}) \to (x^{1},y^{1},-x^{2},-y^{2},-x^{3},-y^{3}) [/tex]
[tex]\mathbb{Z}_{3} \quad \phi &:& (x^{1},y^{1},x^{2},y^{2},x^{3},y^{3}) \to (x^{3},y^{3},x^{1},y^{1},x^{2},y^{2}) [/tex]

Therefore I can write them as matrices (with each '1' being the 2x2 identity matrix) :

[tex]\theta = \left( \begin{array}{ccc}
1 \\ & -1 \\ & & -1
\end{array} \right) [/tex]
[tex]\phi = \left( \begin{array}{ccc}
\quad & \quad & 1 \\ 1 \\ & 1 & \quad
\end{array} \right)[/tex]

The various ways of combining [tex]\theta[/tex] and [tex]\phi[/tex] then lead to 12 different matrixes. [tex]\phi[/tex] gives 3 different layouts for the non-zero entries and depending on where you put [tex]\theta[/tex] in the matrix operator sequence, you shuffle around where the 1's and -1's are (there's 4 different ones for each layout).

At present I'm just computing all combinations of [tex]\theta[/tex] and [tex]\phi[/tex] which go up to length 5 (since I'm working with Z_2 and Z_3) and that covers everything.
 
Last edited:

FAQ: Group generated by Z_p and Z_q ?

What is the definition of a group generated by Z_p and Z_q?

A group generated by Z_p and Z_q is a mathematical structure made up of elements from the sets of integers modulo p and q, respectively. The elements are combined using a binary operation, typically addition or multiplication, and must satisfy certain properties such as closure, associativity, identity, and inverse.

How is the group generated by Z_p and Z_q different from other groups?

The group generated by Z_p and Z_q is unique in that it is generated by two sets of integers with distinct prime numbers p and q. This results in a finite group with a specific number of elements, which can have different properties and behaviors than other groups.

Can the group generated by Z_p and Z_q be infinite?

No, the group generated by Z_p and Z_q is always finite. This is because the sets of integers modulo p and q are finite, and the resulting group is a combination of elements from these two sets.

How is the group generated by Z_p and Z_q related to cryptography?

The group generated by Z_p and Z_q is often used in cryptography, specifically in the Diffie-Hellman key exchange algorithm. This algorithm uses the group to securely exchange keys between two parties, allowing them to communicate privately over a public channel.

Are there any real-world applications of the group generated by Z_p and Z_q?

Yes, besides its use in cryptography, the group generated by Z_p and Z_q has other applications in computer science, engineering, and physics. It can be used to represent and analyze systems with discrete symmetries, such as crystal structures or particle interactions. It also has applications in coding theory, error-correcting codes, and combinatorics.

Similar threads

Back
Top