惯性聚合 高效追踪和阅读你感兴趣的博客、新闻、科技资讯
阅读原文 在惯性聚合中打开

推荐订阅源

Y
Y Combinator Blog
The GitHub Blog
The GitHub Blog
云风的 BLOG
云风的 BLOG
Engineering at Meta
Engineering at Meta
Google DeepMind News
Google DeepMind News
aimingoo的专栏
aimingoo的专栏
Recent Announcements
Recent Announcements
A
About on SuperTechFans
U
Unit 42
MyScale Blog
MyScale Blog
J
Java Code Geeks
博客园_首页
Blog — PlanetScale
Blog — PlanetScale
D
Docker
Microsoft Azure Blog
Microsoft Azure Blog
博客园 - 司徒正美
量子位
月光博客
月光博客
G
Google Developers Blog
V
V2EX
博客园 - 聂微东
宝玉的分享
宝玉的分享
IT之家
IT之家
Vercel News
Vercel News

math.CO updates on arXiv.org

Complement Submodular Information Measures for Balanced and Robust Data Selection A Proof of a Conjecture on Positive and Negative Square Energies of Unicyclic Graphs Laplacian Spectrum of the Weakly Zero-Divisor Graph of a Finite Commutative Ring An identity for second Eulerian numbers via lattice-point counting $t$-tone edge coloring of graphs Constructing Maximal Bumpless Pipedreams for Double Grothendieck Polynomials Mubayi's Polynomial-Ideal Conjecture and Cover-Ideal Turán Methods Implicit Binarization via Complex Phase Dynamics in Combinatorial Optimization The limits of Schur multipliers in Pólya conversion problems for the $q$-permanent function Universality theorems for generalized splines Framing Triangulations for Arbitrary Integer Flow Polytopes On the Common Generalization of Gentle Algebras and Framed Directed Acyclic Graphs The complexity of frugal digraph homomorphisms Chaotic and periodic behavior of jeu de taquin on infinite Young tableaux Enumerating Pattern Avoiding Parking Functions Incidence toric ideals and three-point functions Unique Winning Opening Move in Three-Row Chomp Strong majority colorings of graphs A Balancing Theorem for Spanning Trees of Rectangular Grid Graphs Spectral radius and edge-disjoint connected factors of graphs New invariants for rank metric codes, with applications to the classification of rank two semifields of order 256 Flexible DP-4-coloring of planar graphs without 4-cycles and intersecting triangles Balanced intersection size distributions in projective planes List Reconstruction Problem with List Size Two Is Dimensionality a Barrier for Retrieval Models? The INIEP: Irreducible and Positive Realizations The number of Pfaffian orientations on punctured polygonally cellulated surfaces Explicit Construction of Polytopes whose Ehrhart Polynomials Realize any Given Sign Pattern Finite-state enumeration of adjacency-constrained 132-avoiding permutations AMDS and quantum AMDS Constacyclic codes of length $4p^ς$ over $\mathbb{F}_{{p}^{m}}$
Inclusion graph of annihilators in a commutative ring
Hana Safari, Farzad Shaveisi, Reza Nikandish · 2026-06-14 · via math.CO updates on arXiv.org

Let $R$ be a commutative ring with identity, and let $Z(R)$ be the set of zero-divisors of $R$. The inclusion graph of annihilators in $R$, denoted by $Γ^{\prime}(R)$, is a graph with the vertex set $Z(R)^*=Z(R)\setminus\{0\}$ and two distinct vertices $x$ and $y$ are adjacent if and only if $\operatorname{ann}_R(x)\subseteq \operatorname{ann}_R(y)$ or $\operatorname{ann}_R(y)\subseteq \operatorname{ann}_R(x)$. It is proved that $Γ^{\prime}(R)$ is not connected if and only if $R$ is reduced with $|\operatorname{Min}(R)|=2$. Also, we show that if $Γ^{\prime}(R)$ is a connected graph, then the diameter of $Γ^{\prime}(R)$ is at most $4$ and the girth of $Γ^{\prime}(R)$ is at most $6$, if it contains a cycle. Moreover, we study the affinity between inclusion graph of annihilators and complement of the annihilator graph (a well-known graph with the same vertices and two distinct vertices $x$ and $y$ are adjacent if and only if $\operatorname{ann}_R(xy)\neq \operatorname{ann}_R(x)\cup \operatorname{ann}_R(y)$) associated with a commutative ring. Finally, we characterize all rings whose inclusion graphs of annihilators are complete.