Generalized Irreducible Divisor Graphs
Commutative Algebra
2014-01-03 v1 Combinatorics
Abstract
In 1988, I. Beck introduced the notion of a zero-divisor graph of a commutative rings with . There have been several generalizations in recent years. In particular, in 2007 J. Coykendall and J. Maney developed the irreducible divisor graph. Much work has been done on generalized factorization, especially -factorization. The goal of this paper is to synthesize the notions of -factorization and irreducible divisor graphs in domains. We will define a -irreducible divisor graph for non-zero non-unit elements of a domain. We show that by studying -irreducible divisor graphs, we find equivalent characterizations of several finite -factorization properties.
Keywords
Cite
@article{arxiv.1312.7406,
title = {Generalized Irreducible Divisor Graphs},
author = {Christopher Park Mooney},
journal= {arXiv preprint arXiv:1312.7406},
year = {2014}
}
Comments
17 pages, 2 figures, to appear in Communications in Algebra