加载中…
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 of class 3 with triality and generators, based on embeddings of into direct products of copies of . In the finite case, where is a group such that with and , we prove that the corresponding Moufang loop is the free loop with generators in the variety generated by code loops. The result depends on a construction similar to that of , namely, embedding into direct products of copies of , the free code loop associated with .

生成讲解博客的中文版本

生成AI智能校验的中文版本