SearcharxivSearch

arXiv · 1509.00420

On Engel groups, nilpotent groups, rings, braces and the Yang-Baxter equation

Abstract

It is shown that over an arbitrary field there exists a nil algebra $R$ whose adjoint group $R^{o}$ is not an Engel group. This answers a question by Amberg and Sysak from 1997 [5] and answers related questions from [3, 44]. The case of an uncountable field also answers a recent question by Zelmanov. In [38], Rump introduced braces and radical chains $A^{n+1}=A\cdot A^{n}$ and $A^{(n+1)}=A^{(n)}\cdot A$ of a brace $A$. We show that the adjoint group $A^{o}$ of a finite right brace is a nilpotent group if and only if $A^{(n)}=0$ for some $n$. We also show that the adjoint group of $A^{o}$ of a finite left brace $A$ is a nilpotent group if and only if $A^{n}=0$ for some $n$. Moreover, if $A^{o}$ is a nilpotent group then $A$ is the direct sum of braces whose cardinatities are powers of prime numbers. Notice that $A^{o}$ is sometimes called the multiplicative group of a brace $A$ (for example in [13]). We also introduce a chain of ideals $A^{[n]}$ of a left brace $A$ and then use it to investigate braces which satisfy $A^{n}=0$ and $A^{(m)}=0$ for some $m, n$ (Theorems 2, 3). In Section 2 we describe connections between our results and braided groups and the Yang-Baxter equation. It is worth noticing that by a result by Gateva-Ivanova [17] braces are in one-to-one correspondence with braided groups with involutive braided operators.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Agata Smoktunowicz. 2017-04-11. On Engel groups, nilpotent groups, rings, braces and the Yang-Baxter equation. https://arxiv.org/abs/1509.00420

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Invariants of Nilpotent Lie Algebras via Geometry and Algebra with a Focus on Computation

We consider the problem of computing rational invariants of nilpotent Lie algebras. We compare two methods that are commonly used for this task: the method of integral curves and the Dixmier map. Given a derivation of a rational function field with polynomial coefficients, we formulate a condition under which the kernel can be recovered from a family of rational integral curves, and we show that triangular derivations satisfy this hypothesis. This yields an explicit description of the kernel as a purely transcendental extension and produces algebraically independent generators. We also show that, in the triangular case, the resulting generators agree with those obtained from the Dixmier map via a local slice. A careful analysis of the generating set obtained from this method leads to an algorithm for computing generators of the rational invariant field of a nilpotent Lie algebra. An implementation of the methods is available in the SageMath system.

math.RA

Quasilinear multiplication in the real Cayley--Dickson tower

Direct evaluation of the defining product in the real Cayley--Dickson algebra $A_n$, of dimension $N=2^n$, has quadratic arithmetic complexity. This paper gives a uniform algorithm for multiplication using $O(N\log N)$ real arithmetic operations and $O(N)$ auxiliary storage. The algorithm reduces multiplication to the alternating product on the imaginary subspace, then evaluates that product by a two-call recursion over one fixed quadratic coefficient extension. For $n\ge1$, the resulting bilinear algorithm uses at most $(9n-15)2^{n-1}+10$ input-dependent real multiplications, and for $n\ge3$, the specified arithmetic schedule uses $(34n-83)2^{n-1}+50$ real operations in total. Under this counting convention, the quasilinear schedule uses fewer operations than direct multiplication for $N\ge16$ and than the uniform Cariow--Cariowa method for $N\ge32$. The algorithm is implemented in the MIT-licensed C11 library fastCD, with a NumPy-backed Python interface, and its results are checked against an independent implementation of the defining recursion. In single-core benchmarks against direct multiplication and the uniform Cariow--Cariowa method, the quasilinear implementation had the lowest mean time of the three at every tested dimension $N\ge32$, for both single and batched products, and was roughly $16$ times faster than direct multiplication at $N=1024$.

math.RA

Graded classification of Leavitt path algebras in terms of strong shift equivalence

Given two finite essential adjacency matrices $A$ and $B$, Hazrat's graded classification conjectures posit that an order preserving $\mathbb{Z}[x,x^{-1}]$-module isomorphism of $K_0$ groups implies graded Morita equivalence of the Leavitt path algebras of $A$ and $B$, while the pointed version predicts a graded isomorphism of the Leavitt path algebras when the $K_0$ group isomorphism additionally preserves the class of the regular module. For any field $k$, we show that the Leavitt path algebras over $k$ of $A$ and $B$ are graded Morita equivalent if and only if $A$ and $B$ are strong shift equivalent. By appealing to counterexamples of Kim and Roush from symbolic dynamics, this shows that Hazrat's graded classification conjectures are false.

math.RA