A combinatorial proof of Gotzmann's persistence theorem for monomial ideals

Simple item page
dc.creatorMurai, Satoshi
dc.date2005-04-21
dc.date.accessioned2026-07-07T09:31:37Z
dc.date.available2026-07-07T09:31:37Z
dc.descriptionGotzmann proved the persistence for minimal growth for ideals. His theorem is called Gotzmann's persistence theorem. In this paper, based on the combinatorics on binomial coefficients, a simple combinatorial proof of Gotzmann's persistence theorem in the special case of monomial ideals is given.
dc.identifierhttps://arxiv.org/abs/math/0504429
dc.identifierhttp://arxiv.org/abs/math/0504429
dc.identifierEuropean J. Combin. 29 (2008), 322--333
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/158523
dc.subjectCombinatorics
dc.subjectCommutative Algebra
dc.subject05E99, 13F20
dc.titleA combinatorial proof of Gotzmann's persistence theorem for monomial ideals
dc.typetext

Files

Collections

arXiv