On the evaluation at (-i,i) of the Tutte polynomial of a binary matroid
Rudi Pendavingh

TL;DR
This paper explores the complex evaluation of the Tutte polynomial at (-i, i) for binary matroids, revealing its dependence on a quadratic form and providing polynomial-time evaluation methods.
Contribution
It introduces a new understanding of the argument of T_M(-i, i) via a canonical quadratic form and offers algorithms for polynomial-time computation of related invariants.
Findings
Expression of the argument in terms of a quadratic form
Polynomial-time evaluation algorithm for T_M(-i, i)
Description of the canonical tripartition and related invariants
Abstract
Vertigan has shown that if is a binary matroid, then , the modulus of the Tutte polynomial of as evaluated in , can be expressed in terms of the bicycle dimension of . In this paper, we describe how the argument of the complex number depends on a certain -valued quadratic form that is canonically associated with . We show how to evaluate in polynomial time, as well as the canonical tripartition of and further related invariants.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsPolynomial and algebraic computation · Advanced Combinatorial Mathematics · Advanced Graph Theory Research
