Constructive proofs of resolution of singularities over fields of characteristic zero are defined in terms of the order of ideals. However the function order has to be corrected, in order to compute centers having normal crossings with the previous exceptional divisor E. In this paper we present an algorithm of resolution of singularities (in characteristic zero), constructed using a function κ...

In previous literature Coykendall & Maney, as well as Axtell & Stickles, have discussed the concept of irreducible divisor graphs of elements in domains and ring with zero-divisors respectively, with two different definitions. In this paper we seek to look at the irreducible divisor graphs of ring elements under a hybrid definition of the two previous ones—in hopes that this graph will reveal s...

In this paper, we introduce the multiplicative zero-divisor graph of a multiplicative lattice and study Beck-like coloring of such graphs. Further, it is proved that for such graphs, the chromatic number and the clique number need not be equal. On the other hand, if a multiplicative lattice L is reduced, then the chromatic number and the clique number of the multiplicative zero-divisor graph of...

We discuss the dependence of superpotential terms in 4D F-theory on moduli parameters. Two cases are studied: the dependence on world-filling 3-brane positions and the dependence on 2-form VEVs. In the first case there is a zero when the 3-brane hits the divisor responsible for the superpotential. In the second case, which has been extensively discussed by Witten in 3D M-theory, there is a zero...

Abstract. In this article we revisit a problem regarding Bézout domains, namely, whether every Bézout domain is an elementary divisor domain. Elementary divisor domains where defined by Kaplansky [13] and generalized to rings with zero-divisors by Gillman and Henriksen [7]. Later, in [14] it was shown that a domain R is an elementary divisor domain if and only if every finitely presented R-modu...

Let R be a commutative unital finite rings and Z(R) its set of zero divisors. The study automorphisms algebraic structures via divisor graphs is still an active area research. Perhaps, because the fact that have got real life application in capturing symmetries structures. In this study, such which product any four has been determined.

In mathematics, the greatest common divisor (gcd), also known as the greatest common factor (gcf), highest common factor (hcf), or greatest commonmeasure (gcm), of two or more integers (when at least one of them is not zero), is the largest positive integer that divides the numbers without a remainder. For example, the GCD of 8 and 12 is 4.[1][2] This notion can be extended to polynomials, see ...