The combinatorial characterization conjecture for the matroid invariant

From papers

Let MM be a loop- and co-loop-free matroid, let PolyM\operatorname{Poly}_M be its matroid polytope, and let GMG_M be a polynomial assigned to each isomorphism class of such matroids. For a polyhedral decomposition D\mathcal{D} of PolyM\operatorname{Poly}_M into smaller matroid polytopes, let D˚\mathring{\mathcal{D}} denote the set of interior faces. A series-parallel matroid is understood in the standard sense.

Combinatorial characterization conjecture. If the assignment MGMM\mapsto G_M satisfies

  1. for every such decomposition,
GM=PolyFD˚GF,G_M=\sum_{\operatorname{Poly}_F\in\mathring{\mathcal{D}}}G_F,
  1. if MM is a direct sum of cc series-parallel matroids, then
GM=tc,G_M=t^c,

then GM=gMG_M=g_M.

This conjecture asks whether the stated valuation and normalization properties uniquely determine the invariant gMg_M. The source calls it essentially combinatorial and supplies no resolution evidence, so it remains open.

Progress summary

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Sources & referencesView supporting material

Primary source

David E Speyer, “A matroid invariant via the K-theory of the Grassmannian”, arXiv:math/0603551 (2006).

Solutions 0

No solutions have been posted yet.