SearcharxivSearch

arXiv · 2303.04372

$(\sigma, \tau)$-Derivations of Group Rings with Applications

Abstract

Leo Creedon and Kieran Hughes in [18] studied derivations of a group ring $RG$ (of a group $G$ over a commutative unital ring $R$) in terms of generators and relators of group $G$. In this article, we do that for $(\sigma, \tau)$-derivations. We develop a necessary and sufficient condition such that a map $f:X \rightarrow RG$ can be extended uniquely to a $(\sigma, \tau)$-derivation $D$ of $RG$, where $R$ is a commutative ring with unity, $G$ is a group having a presentation $\langle X \mid Y \rangle$ ($X$ the set of generators and $Y$ the set of relators) and $(\sigma, \tau)$ is a pair of $R$-algebra endomorphisms of $RG$ which are $R$-linear extensions of the group endomorphisms of $G$. Further, we classify all inner $(\sigma, \tau)$-derivations of the group algebra $RG$ of an arbitrary group $G$ over an arbitrary commutative unital ring $R$ in terms of the rank and a basis of the corresponding $R$-module consisting of all inner $(\sigma, \tau)$-derivations of $RG$. We obtain several corollaries, particularly when $G$ is a $(\sigma, \tau)$-FC group or a finite group $G$ and when $R$ is a field. We also prove that if $R$ is a unital ring and $G$ is a group whose order is invertible in $R$, then every $(\sigma, \tau)$-derivation of $RG$ is inner. We apply the results obtained above to study $\sigma$-derivations of commutative group algebras over a field of positive characteristic and to classify all inner and outer $\sigma$-derivations of dihedral group algebras $\mathbb{F}D_{2n}$ ($D_{2n} = \langle a, b \mid a^{n} = b^{2} = 1, b^{-1}ab = a^{-1}\rangle$, $n \geq 3$) over an arbitrary field $\mathbb{F}$ of any characteristic. Finally, we give the applications of these twisted derivations in coding theory by giving a formal construction with examples of a new code called IDD code.

Explore related subjects

Keep this discovery

BibTeXRIS

Praveen Manju, Rajendra Kumar Sharma. 2023-03-08. $(\sigma, \tau)$-Derivations of Group Rings with Applications. https://arxiv.org/abs/2303.04372

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