Talk:Polymatroid

This isn't the way I'm familiar with the term "polymatroid" being used. Rather a polymatroid is a generalisation of a matroid; if viewed as a rank function the condition that's dropped is that the rank of a set doesn't exceed its cardinality. I think White's original definition in Combinatorial geometries was of a polymatroid (in the article's sense) for a polymatroid (in my sense), but I don't want to amend this till I have the book in hand again. 4pq1injbok (talk) 02:48, 10 March 2009 (UTC)

Definition

The definition is not very helpful. What is x(U), if x is a vector (indexed vector of size |S|, i guess?) and U is a subset of S?--130.149.12.73 (talk) 16:56, 8 January 2013 (UTC)

To make things clear, I have checked the Schrijver book: x is a vector identified with a function S -> |R, where x(U) is defined to be the sum of the vector elements that are also in U. --130.149.12.73 (talk) 12:01, 9 January 2013 (UTC)