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

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

2005-04-21

arxiv.org/abs/math/0504429v1

European J. Combin. 29 (2008), 322--333

Mathematics

Combinatorics

Scientific paper

Gotzmann 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.

Affiliated with

Also associated with

No associations

Rating

A combinatorial proof of Gotzmann's persistence theorem for monomial ideals does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A combinatorial proof of Gotzmann's persistence theorem for monomial ideals, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A combinatorial proof of Gotzmann's persistence theorem for monomial ideals will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-315608