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

被引:4
|
作者
Murai, Satoshi [1 ]
机构
[1] Osaka Univ, Grad Sch Informat Sci & Technol, Dept Pure & Appl Math, Toyonaka, Osaka 560, Japan
基金
日本学术振兴会;
关键词
D O I
10.1016/j.ejc.2006.07.012
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
Gotzmann proved the persistence for minimal growth of Hilbert functions of homogeneous ideals. His theorem is called Gotzmann's persistence theorem. In this paper, based on the combinatorics of binomial coefficients, a simple combinatorial proof of Gotzmann's persistence theorem in the special case of monomial ideals is given. (c) 2006 Elsevier Ltd. All rights reserved.
引用
收藏
页码:322 / 333
页数:12
相关论文
共 50 条