Distinct Matroid Base Weights and Additive Theory
نویسندگان
چکیده
Let M be a matroid on a set E and let w : E −→ G be a weight function, where G is a cyclic group. Assuming that w(E) satisfies the Pollard’s Condition (i.e. Every non-zero element of w(E)−w(E) generates G), we obtain a formulae for the number of distinct base weights. If |G| is a prime, our result coincides with a result Schrijver and Seymour. We also describe Equality cases in this formulae. In the prime case, our result generalizes Vosper’s Theorem.
منابع مشابه
On the generality of the greedy algorithm for solving matroid base problems
It is well known that the greedy algorithm solves matroid base problems for all linear cost functions and is, in fact, correct if and only if the underlying combinatorial structure of the problem is a matroid. Moreover, the algorithm can be applied to problems with sum, bottleneck, algebraic sum or k-sum objective functions. In this paper, we address matroid base problems with a more general – ...
متن کاملOriented Matroid Pairs, Theory and an Electric Application
The property that a pair of oriented matroidsM ? L , M R on E have free union and no common (non-zero) covector generalizes oriented matroid duality. This property characterizes when certain systems of equations whose only nonlinearities occur as real monotone bijections have a unique solution for all values of additive parameters. Instances include sign non-singularity of square matrices and g...
متن کاملFlag enumerations of matroid base polytopes
In this paper, we study flag structures of matroid base polytopes. We describe faces of matroid base polytopes in terms of matroid data, and give conditions for hyperplane splits of matroid base polytopes. Also, we show how the cd-index of a polytope can be expressed when a polytope is split by a hyperplane, and apply these to the cd-index of a matroid base polytope of a rank 2 matroid.
متن کاملMatroid intersection, base packing and base covering for infinite matroids
As part of the recent developments in infinite matroid theory, there have been a number of conjectures about how standard theorems of finite matroid theory might extend to the infinite setting. These include base packing, base covering, and matroid intersection and union. We show that several of these conjectures are equivalent, so that each gives a perspective on the same central problem of in...
متن کاملOn Circuit Valuation of Matroids 1
The concept of valuated matroids was introduced by Dress and Wenzel as a quantitative extension of the base exchange axiom for matroids. This paper gives several sets of cryptomorphically equivalent axioms of valuated matroids in terms of (R[f 1g)-valued vectors de ned on the circuits of the underlying matroid, where R is a totally ordered additive group. The dual of a valuated matroid is chara...
متن کامل