2000 character limit reached
Stanley depth and simplicial spanning trees
Published 14 Oct 2014 in math.AC and math.CO | (1410.3666v2)
Abstract: We show that for proving the Stanley conjecture, it is sufficient to consider a very special class of monomial ideals. These ideals (or rather their lcm lattices) are in bijection with the simplicial spanning trees of skeletons of a simplex. We apply this result to verify the Stanley conjecture for quotients of monomial ideals with up to six generators. For seven generators we obtain a partial result.
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.