Papers
Topics
Authors
Recent
Assistant
AI Research Assistant
Well-researched responses based on relevant abstracts and paper content.
Custom Instructions Pro
Preferences or requirements that you'd like Emergent Mind to consider when generating responses.
Gemini 2.5 Flash
Gemini 2.5 Flash 62 tok/s
Gemini 2.5 Pro 51 tok/s Pro
GPT-5 Medium 36 tok/s Pro
GPT-5 High 30 tok/s Pro
GPT-4o 67 tok/s Pro
Kimi K2 192 tok/s Pro
GPT OSS 120B 430 tok/s Pro
Claude Sonnet 4.5 34 tok/s Pro
2000 character limit reached

Rees algebras of complementary edge ideals (2509.18048v1)

Published 22 Sep 2025 in math.AC and math.CO

Abstract: In this paper we investigate the Rees algebras of squarefree monomial ideals $I \subset S=K[x_1,\dots,x_n]$ generated in degree $n-2$, where $K$ is a field. Every such ideal arises as the complementary edge ideal $I_c(G)$ of a finite simple graph $G$. We describe the defining equations of the Rees algebra $\mathcal{R}(I_c(G))$ in terms of the combinatorics of $G$. When $G$ is a bipartite or a connected unicyclic graph, we show that $\mathcal{R}(I_c(G))$ is a normal Cohen-Macaulay domain. If $G$ is a tree or a unicyclic graph whose unique induced cycle has length $3$ or $4$, we further prove that $\mathcal{R}(I_c(G))$ is Koszul. We also determine the asymptotic depth of the powers of $I_c(G)$, proving that $\lim_{k \to \infty}\text{depth}\, S/I_c(G)k=b(G)$, where $b(G)$ is the number of bipartite connected components of $G$. Finally, we show that the index of depth stability of $I_c(G)$ is at most $n-2$, and equality holds when $G$ is a path graph.

Summary

We haven't generated a summary for this paper yet.

Lightbulb Streamline Icon: https://streamlinehq.com

Continue Learning

We haven't generated follow-up questions for this paper yet.

List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

Sign up for free to add this paper to one or more collections.