Search arXivSearch

arXiv · 2602.16202

On cyclic invariants of the free associative algebra

Abstract

Let $K\langle X_d\rangle$ be the free associative algebra of rank $d \geq 2$ over a field $K$. Lane in 1976 and Kharchenko in 1978 proved that the algebra of invariants $K\langle X_d\rangle^G$ is free for any subgroup $G \leq \text{GL}_d(K)$ and any field $K$. Later, Kharchenko introduced an additional action of the symmetric group $\text{Sym}(n)$ on the homogeneous component of degree $n$ of $K\langle X_d\rangle$, given by permuting the positions of the variables. This equips $K\langle X_d\rangle$ with the structure of a $(K\langle X_d\rangle,\circ)$-$S$-algebra. Then Koryukin showed that the algebra of invariants $K\langle X_d\rangle^G$ is finitely generated for every reductive group $G$ with respect to this action. In our paper we study the algebra $K\langle x_1,\ldots,x_d\rangle^{C_d}$ of invariants of the cyclic group $C_d$, $d\geq 2$, where $K$ is an arbitrary field of characteristic 0. We compute the Hilbert series of $K\langle x_1,\ldots,x_d \rangle^{C_d}$. When $K=\mathbb C$ we find a vector space basis of ${\mathbb C}\langle x_1,\ldots,x_d \rangle^{C_d}$ and explicitly describe the generators of ${\mathbb C}\langle x_1,\ldots,x_d \rangle^{C_d}$ as a free algebra. Moreover, we describe a finite generating set for the $S$-algebra $({\mathbb C}\langle x_1,\ldots,x_d \rangle^{C_d},\circ)$. We also transfer the results for $K=\mathbb C$ to the case of an arbitrary field of characteristic 0 for the $S$-algebra $(K\langle x_1,x_2,x_3 \rangle^{C_3},\circ)$ and find a minimal generating set for it as an $S$-algebra.

Explore related subjects

Keep this discovery

BibTeXRIS

Silvia Boumova, Vesselin Drensky. 2026-02-18. On cyclic invariants of the free associative algebra. https://arxiv.org/abs/2602.16202

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