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 square-free monomial ideals (1205.3127v2)

Published 14 May 2012 in math.AC

Abstract: We study the defining equations of the Rees algebra of square-free monomial ideals in a polynomial ring over a field. We determine that when an ideal $I$ is generated by $n$ square-free monomials of the same degree then $I$ has relation type at most $n-2$ as long as $n \leq 5$. In general, we establish the defining equations of the Rees algebra in this case. Furthermore, we give a class of examples with relation type at least $n-2$, where $n=\mu(I)$. We also provide new classes of ideals of linear type. We propose the construction of a graph, namely the generator graph of an ideal, where the monomial generators serve as vertices for the graph. We show that when $I$ is a square-free monomial ideal generated in the same degree that is at least 2 and the generator graph of $I$ is the graph of a disjoint union of trees and graphs with unique odd cycles then $I$ is an ideal of linear type.

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.