SearcharxivSearch

arXiv · 1411.4159

The Annihilating-Ideal Graph of a Ring

Abstract

Let $S$ be a semigroup with $0$ and $R$ be a ring with $1$. We extend the definition of the zero-divisor graphs of commutative semigroups to not necessarily commutative semigroups. We define an annihilating-ideal graph of a ring as a special type of zero-divisor graph of a semigroup. We introduce two ways to define the zero-divisor graphs of semigroups. The first definition gives a directed graph ${\Gamma}(S)$, and the other definition yields an undirected graph $\overline{{\Gamma}}(S)$. It is shown that $\Gamma(S)$ is not necessarily connected, but $\overline{{\Gamma}}(S)$ is always connected and ${\rm diam}(\overline{\Gamma}(S))\leq 3$. For a ring $R$ define a directed graph $\Bbb{APOG}(R)$ to be equal to $\Gamma(\Bbb{IPO}(R))$, where $\Bbb{IPO}(R)$ is a semigroup consisting of all products of two one-sided ideals of $R$, and define an undirected graph $\overline{\Bbb{APOG}}(R)$ to be equal to $\overline{\Gamma}(\Bbb{IPO}(R))$. We show that $R$ is an Artinian (resp., Noetherian) ring if and only if $\Bbb{APOG}(R)$ has DCC (resp., ACC) on some special subset of its vertices. Also, It is shown that $\overline{\Bbb{APOG}}(R)$ is a complete graph if and only if either $(D(R))^{2}=0$, $R$ is a direct product of two division rings, or $R$ is a local ring with maximal ideal $\mathfrak{m}$ such that $\Bbb{IPO}(R)=\{0,\mathfrak{m},\mathfrak{m}^{2}, R\}$. Finally, we investigate the diameter and the girth of square matrix rings over commutative rings $M_{n\times n}(R)$ where $n\geq 2$.

Explore related subjects

Keep this discovery

BibTeXRIS

F. Aliniaeifard, M. Behboodi, Y. Li. 2014-11-15. The Annihilating-Ideal Graph of a Ring. https://arxiv.org/abs/1411.4159

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