Cameron, Amanda and Fink, Alex - A lattice point counting generalisation of the Tutte polynomial

dmtcs:6331 - Discrete Mathematics & Theoretical Computer Science, April 22, 2020, DMTCS Proceedings, 28th International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2016)
A lattice point counting generalisation of the Tutte polynomial

Authors: Cameron, Amanda and Fink, Alex

The Tutte polynomial for matroids is not directly applicable to polymatroids. For instance, deletion- contraction properties do not hold. We construct a polynomial for polymatroids which behaves similarly to the Tutte polynomial of a matroid, and in fact contains the same information as the Tutte polynomial when we restrict to matroids. This polynomial is constructed using lattice point counts in the Minkowski sum of the base polytope of a polymatroid and scaled copies of the standard simplex. We also show that, in the matroid case, our polynomial has coefficients of alternating sign, with a combinatorial interpretation closely tied to the Dawson partition.


Volume: DMTCS Proceedings, 28th International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2016)
Published on: April 22, 2020
Submitted on: July 4, 2016
Keywords: [MATH.MATH-CO]Mathematics [math]/Combinatorics [math.CO]


Share

Consultation statistics

This page has been seen 22 times.
This article's PDF has been downloaded 33 times.