Construction of groups with triality and their corresponding code loops
Fuente:
arXiv
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Preprint |
| Published: |
2026
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866912804181639168 |
|---|---|
| author | Pires, Rosemary Miguel Grishkov, Alexandre Rodrigues, Rodrigo Lucas Rasskazova, Marina |
| author_facet | Pires, Rosemary Miguel Grishkov, Alexandre Rodrigues, Rodrigo Lucas Rasskazova, Marina |
| contents | We generalize the global construction of code loops introduced by Nagy, which is based on the connection between Moufang loops and groups with triality. This follows from the construction of a nilpotent group $G_n$ of class 3 with triality and $2n$ generators, based on embeddings of $G_n$ into direct products of copies of $G_3$. In the finite case, where $G_n$ is a group such that $|G_n| = 2^{4n+m}$ with $n \ge 3$ and $m = 3 {n \choose 2} + 2 {n \choose 3}$, we prove that the corresponding Moufang loop is the free loop $F_n$ with $n$ generators in the variety generated by code loops. The result depends on a construction similar to that of $G_n$, namely, embedding $F_n$ into direct products of copies of $F_3$, the free code loop associated with $G_3$. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2601_02546 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | Construction of groups with triality and their corresponding code loops Pires, Rosemary Miguel Grishkov, Alexandre Rodrigues, Rodrigo Lucas Rasskazova, Marina Group Theory 20N05, 20B25 We generalize the global construction of code loops introduced by Nagy, which is based on the connection between Moufang loops and groups with triality. This follows from the construction of a nilpotent group $G_n$ of class 3 with triality and $2n$ generators, based on embeddings of $G_n$ into direct products of copies of $G_3$. In the finite case, where $G_n$ is a group such that $|G_n| = 2^{4n+m}$ with $n \ge 3$ and $m = 3 {n \choose 2} + 2 {n \choose 3}$, we prove that the corresponding Moufang loop is the free loop $F_n$ with $n$ generators in the variety generated by code loops. The result depends on a construction similar to that of $G_n$, namely, embedding $F_n$ into direct products of copies of $F_3$, the free code loop associated with $G_3$. |
| title | Construction of groups with triality and their corresponding code loops |
| topic | Group Theory 20N05, 20B25 |
| url | https://arxiv.org/abs/2601.02546 |