Discrete Polymatroids
Juergen Herzog, Takayuki Hibi
Abstract
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.
Create a lesson
Related papers
Finitistic dimensions of formal power series rings
Xiaolei Zhang, Weiheng Xia
On the existence of Gorenstein injective covers
Yuhui Hua, Shun-Jie Li, Chencheng Zhang
Improved Upper Bounds for the Rank of the Determinant Tensor via Glynn's Formula
Jeong-Hoon Ju, Hayoung Choi, Taehyeong Kim
Waring rank of certain complete intersection forms
Meghana Bhat, Enrico Carlini, Shreedevi K. Masuti et al.
Combinatorial bounds for the v-number of binomial edge ideals
Emiliano Liwski
Asymptotic Lech Bounds and Bertini Flags
Hong-Ge Chen, Fei Liu