Search arXivSearch

arXiv · 2506.16919

Counter-example to Conjectures on Complemented Zero-Divisor Graphs of Semigroups

Abstract

In this paper, we are motivated by two conjectures proposed by C. Bender et al.\ in 2024, which have remained open questions. The first conjecture states that if the complemented zero-divisor graph \( G(S) \) of a commutative semigroup \( S \) with a zero element has the clique number three or greater, then the reduced graph \( G_r(S) \) is isomorphic to the graph \( G(\mathcal{P}(n)) \). The second conjecture asserts that if \( G(S) \) is a complemented zero-divisor graph with the clique number three or greater, then \( G(S) \) is uniquely complemented. In this work, we construct a commutative semigroup \( S \) with a zero element that serves as a counter-example to both conjectures.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Anagha Khiste, Ganesh Tarte, Vinayak Joshi. 2025-06-20. Counter-example to Conjectures on Complemented Zero-Divisor Graphs of Semigroups. https://arxiv.org/abs/2506.16919

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Rooted Spider Embeddings and the Erd\H os-Sós Conjecture

Under a local density condition, we prove that every $k$-edge spider embeds at any prescribed center of degree at least $k$, unless all legs are even and the host graph has one of two specified structures. These structures contain complete bipartite subgraphs with prescribed neighborhoods. The proof uses path rerouting and three exchange lemmas that describe equality in neighborhood estimates. As a consequence, we recover the Erd\H os-Sós bound for all spiders.

math.CO

Generalized Goulden-Yong duals and signed minimal factorizations

In this paper, we give two combinatorial ways to study signed exceptional sequences. First, we show the equivalence between one-way reflections and relatively projective representations. Secondly, we construct generalized Goulden-Yong duals using reverse Garside element actions and folded chord diagrams. We then give two applications of the generalized Goulden-Yong duals: constructing generalized Prüfer codes and counting signed factorizations using the matrix-tree theorem.

math.CO

Explicit expressions for iterates of power series

We present several formulas for both the discrete and fractional iterates of an invertible power series $f$, using a new unifying approach based on umbral calculus. Known formulas are extended, and their proofs simplified, while new expressions are introduced. In particular, by employing $q$-calculus identities, we eliminate the requirement for $f'(0)$ to equal $1$ and the resulting general expressions for the iterative logarithm are obtained as well.

math.CO