2000 character limit reached
Monomial localizations and polymatroidal ideals
Published 14 Jun 2012 in math.AC and math.CO | (1206.3069v1)
Abstract: In this paper we consider monomial localizations of monomial ideals and conjecture that a monomial ideal is polymatroidal if and only if all its monomial localizations have a linear resolution. The conjecture is proved for squarefree monomial ideals where it is equivalent to a well-known characterization of matroids. We prove our conjecture in many other special cases. We also introduce the concept of componentwise polymatroidal ideals and extend several of the results, known for polymatroidal ideals, to this new class of ideals.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.