A lattice point counting generalisation of the Tutte polynomial
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 po...
Main Authors: | Amanda Cameron, Alex Fink |
---|---|
Format: | Article |
Language: | English |
Published: |
Discrete Mathematics & Theoretical Computer Science
2020-04-01
|
Series: | Discrete Mathematics & Theoretical Computer Science |
Subjects: | |
Online Access: | https://dmtcs.episciences.org/6331/pdf |
Similar Items
-
Fourientation activities and the Tutte polynomial
by: Spencer Backman, et al.
Published: (2020-04-01) -
Some results on counting roots of polynomials and the Sylvester resultant.
by: Michael Monagan, et al.
Published: (2020-04-01) -
Schur polynomials and matrix positivity preservers
by: Alexander Belton, et al.
Published: (2020-04-01) -
The Prism tableau model for Schubert polynomials
by: Anna Weigandt, et al.
Published: (2020-04-01) -
Matrix product and sum rule for Macdonald polynomials
by: Luigi Cantini, et al.
Published: (2020-04-01)