A recursive definition for the polymatroid Tutte polynomial
Abstract
The Tutte polynomial is a significant invariant of graphs and matroids. It is well-known that it has three equivalent definitions: bases expansion, rank generating function, and deletion-contraction formula. The polymatroid Tutte polynomial TP generalizes the Tutte polynomial from matroids to polymatroids P. In [Adv. Math. 402 (2022) 108355.] and [J. Combin. Theory Ser. A 188 (2022) 105584], the authors provided bases expansion and rank generating function constructions for TP, respectively. In [Int. Math. Res. Not. 19 (2025) rnaf302], a recursive formula for TP was obtained. In this paper, we show that the recursive formula itself can be used to define the polymatroid Tutte polynomial independently.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.