Let $R$ be a commutative ring and $mathbb{A}(R)$ be the set of all ideals with non-zero annihilators. Assume that $mathbb{A}^*(R)=mathbb{A}(R)diagdown {0}$ and $mathbb{F}(R)$ denote the set of all finitely generated ideals of $R$. In this paper, we introduce and investigate the {it finitely generated subgraph} of the annihilating-ideal graph of $R$, denoted by $mathbb{AG}_F(R)$. It is the (undi...

In this article, we give several generalizations of the concept of annihilating an ideal graph over a commutative ring with identity to modules. We observe that, over a commutative ring, R, AG∗(RM) is connected, and diamAG∗(RM) ≤ 3. Moreover, if AG∗(RM) contains a cycle, then grAG∗(RM) ≤ 4. Also for an R-module M with A∗(M) ̸= S(M) \ {0}, A∗(M) = ∅, if and only if M is a uniform module, and ann(...

Abstract We determine the metric dimension of annihilating-ideal graph a local finite commutative principal ring and with two maximal ideals. also find bounds for an arbitrary ring.

The concepts of a prime ideal of a distributively generated (d.g.) nearring R, a prime d.g. near-ring and an irreducible R-group are introduced1). The annihilating ideal of an irreducible R-group with an R-generator is a prime ideal. Consequently we define a prime ideal to be primitively prime if it is the annihilating ideal of such an R-group, and a d.g. near-ring to be a primitively prime nea...

Let L be a lattice. The annihilating-ideal graph of is simple whose vertex set the all nontrivial ideals and two distinct vertices I J are adjacent if only I∧J=0. In this paper, crosscap graphs lattices with at most four atoms characterized. These characterizations provide classes multipartite graphs, which embedded in Klein bottle.

Let f1, . . . , fp be polynomials in C[x1, . . . , xn] and let D = Dn be the n-th Weyl algebra. We provide upper bounds for the complexity of computing the annihilating ideal of fs = f1 1 · · · f sp p in D[s] = D[s1, . . . , sp]. These bounds provide an initial explanation on the differences between the running times of the two methods known to obtain the so-called BernsteinSato ideals.

We describe an algorithm deciding if the annihilating ideal of the meromorphic function 1 f , where f = 0 defines an arrangement of hyperplanes, is generated by linear differential operators of order 1. The algorithm is based on the comparison of two characteristic cycles and uses a combinatorial description due to Àlvarez-Montaner, Garćıa–López and Zarzuela of the characteristic cycle of the D...