TOPICS
Search

Polymatroid


A polymatroid on a finite ground set E is the polytope defined by a normalized nondecreasing submodular function r:2^E->R_(>=0):

 P(r)={x in R_(>=0)^E:sum_(e in A)x_e<=r(A) for every A subset= E}.

Its base polytope imposes the additional equality sum_(e in E)x_e=r(E). For integer-valued r, its integer bases are the nonnegative integer vectors in that base polytope. A matroid rank function is a special case; its integer bases are the incidence vectors of matroid bases. For E={1,2} and r(A)=2|A|, the integer bases are (2,2). Counting common integer polymatroid bases counts vectors once, rather than their representations by labeled copies.

The integer bases also support an activity generating function, the polymatroid Tutte polynomial. For connected hypergraphs, the corresponding bases yield the hypergraph Tutte polynomial.


See also

Common Integer Polymatroid Basis, Hypergraph Tutte Polynomial, Matroid, Matroid Basis, Polymatroid Tutte Polynomial, Polytope, Submodular Function

Explore with Wolfram|Alpha

References

Tóthmérész, L. "The Two-Variable Hypergraph Tutte Polynomial via Embedding Activities and Computation-Tree Activities." Elec. J. Combin. 33, P4.7, 2026. https://doi.org/10.37236/13306.

Cite this as:

Weisstein, Eric W. "Polymatroid." From MathWorld--A Wolfram Resource. https://mathworld.wolfram.com/Polymatroid.html

Subject classifications