SearcharxivSearch

arXiv · 2012.15509

On clean, weakly clean, and feebly clean commutative group rings

Abstract

A ring $R$ is said to be clean if each element of $R$ can be written as the sum of a unit and an idempotent. $R$ is said to be weakly clean if each element of $R$ is either a sum or a difference of a unit and an idempotent, and $R$ is said to be feebly clean if every element $r$ can be written as $r=u+e_1-e_2$, where $u$ is a unit and $e_1,e_2$ are orthogonal idempotents. Clearly clean rings are weakly clean rings and both of them are feebly clean. In a recent article (J. Algebra Appl. 17 (2018), 1850111(5 pages)), McGoven characterized when the group ring $\mathbb Z_{(p)}[C_q]$ is weakly clean and feebly clean, where $p, q$ are distinct primes. In this paper, we consider a more general setting. Let $K$ be an algebraic number field, $\mathcal O_K$ its ring of integers, $\mathfrak p\subset \mathcal O$ a nonzero prime ideal, and $\mathcal O_{\mathfrak p}$ the localization of $\mathcal O$ at $\mathfrak p$. We investigate when the group ring $\mathcal O_{\mathfrak p}[G]$ is weakly clean and feebly clean, where $G$ is a finite abelian group, and establish an explicit characterization for such a group ring to be weakly clean and feebly clean for the case when $K=\mathbb Q(\zeta_n)$ is a cyclotomic field or $K=\mathbb Q(\sqrt{d})$ is a quadratic field.

Explore related subjects

Keep this discovery

BibTeXRIS

Yuanlin Li, Qinghai Zhong. 2020-12-31. On clean, weakly clean, and feebly clean commutative group rings. https://doi.org/10.1142/s0219498822500852

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