Symbolic defects of edge ideals of unicyclic graphs
Mousumi Mandal, Dipak Kumar Pradhan

TL;DR
This paper investigates the symbolic defects of edge ideals in unicyclic graphs with a unique odd cycle, providing exact calculations, classification, and Hilbert function computations for specific graph classes.
Contribution
It introduces a method to compute symbolic defects of edge ideals in unicyclic graphs and classifies graphs where certain algebraic annihilations occur.
Findings
Exact values of all symbolic defects for unicyclic graphs with odd cycles
A method to find the associated quasi-polynomial of symbolic defects
Classification of graphs where powers of the maximal ideal annihilate certain modules
Abstract
We introduce the concept of minimum edge cover for an induced subgraph in a graph. Let be a unicyclic graph with a unique odd cycle and be its edge ideal. We compute the exact values of all symbolic defects of using the concept of minimum edge cover for an induced subgraph in a graph. We describe one method to find the quasi-polynomial associated with the symbolic defects of edge ideal . We classify the class of unicyclic graphs when some power of maximal ideal annihilates for any fixed . Also for those class of graphs, we compute the Hilbert function of the module for all
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
