Rudi
Pendavingh
TU Eindhoven
Counting cells of the Dressian
Abstract.
A valuation of a matroid M is a map v that assigns a real value v(B) to each basis B of M, such that a quantitative version of the symmetric base exchange axiom holds: v is a valuation of M if and only if (V) for all bases B, B’ of M an all e in B\B’, there is an f in B'\B so that v(B) + v(B’) >= v(B-e+f) + v(B'+e-f). The Dressian is the collection of all valuations of M: Dr(M):= { v : v a valuation of M }. Dr(M) is a polyhedral complex in R^{bases of M}.
In previous joint work with Guus Bollen and Jan Draisma, we found that each algebraic representation of M over a finite field gives rise to a valuation of M. In some cases this fact could be used to rule out that M has an algebraic representation. Such arguments would always involve an enumeration of the cells of Dr(M). This promted the question how the cells of Dr(M) are best enumerated and more broadly, what properties of M limit their number and variation.
In this talk, I describe a method for bounding the number of cells of the Dressian, inspired by entropy counting and the contained method.