A combinatorial proof of Gotzmann's persistence theorem for monomial ideals
Satoshi Murai
Abstract
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.
Create a lesson
Related papers
Combinatorics of hyperplane arrangements and Witten zeta function at the origin
Kam Cheong Au, Kazuhiro Onodera
Proof of the Pach-Tardos conjecture
Lior Gishboliner, Xiangyu Li
Longest cycles intersect linearly in highly connected graphs
Jie Ma, Bo Ning, Ziyuan Zhao
Cutting a convex body into fat parts and approximating Euclidean distance by graph distances
János Pach, Gábor Tardos
A counterexample to the quantum Hedetniemi conjecture
Julius A. Zeiss
Schrijver-Delsarte rigidity in association schemes and undecidability of quantum graph homomorphism
Lorenzo Ciardo, Iris Hebbeker, Gideo Joubert et al.