Compressed zero-divisor graph description for ideals in UFDs
Statement
Let be a unique factorization domain and let be an ideal with a minimal expression
Let be the canonical map, and let be the zero-divisor basis of , consisting of suitable nonassociate divisors of the generators. The compressed zero-divisor graph has vertices represented by annihilator-equivalence classes of elements with each .
Compressed-graph structure conjecture. An edge joins the vertices represented by and if and only if
for some .
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.