论文信息 - Discrete Polymatroids

Discrete Polymatroids

The discrete polymatroid is a multiset analogue of the matroid. Based on the polyhedral theory on integral polymatroids developed in late 1960's and in early 1970's, in the present paper the combinatorics and algebra on discrete polymatroids will be studied.

Takayuki Hibi | Juergen Herzog

[1] Takayuki Hibi,et al. Gorenstein Algebras of Veronese Type , 1997 .

[2] Kazuo Murota,et al. Discrete convex analysis , 1998, Math. Program..

[3] I. Gelfand,et al. Combinatorial Geometries, Convex Polyhedra, and Schubert Cells , 1987 .

[4] K. Murota. Convexity and Steinitz's Exchange Property , 1996 .

[5] Kazuo Murota,et al. M-Convex Function on Generalized Polymatroid , 1999, Math. Oper. Res..

[6] Satoru Fujishige,et al. Submodular functions and optimization , 1991 .

[7] Yukihide Takayama,et al. Resolutions by mapping cones , 2001 .

[8] Neil White,et al. A unique exchange property for bases , 1980 .

[9] B. Sturmfels. Gröbner bases and convex polytopes , 1995 .

[10] Takayuki Hibi,et al. Combinatorial pure subrings , 2000 .