On zeros of the characteristic polynomial of matroids of bounded tree-width

DOI10.1016/J.EJC.2016.08.011MaRDI QIDQ338570zbMATH OpenOpenAlexFDO

Authors Carolyn Chun, Rhiannon Hall, Criel Merino, Steven D. Noble

Publication date 7 November 2016

Published in European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1703.02393

zbMATH Keywords

\(\mathrm{GF}(q)\)-representable matroid

Mathematics Subject Classification ID

Matroids in convex geometry (realizations in the context of convex polytopes, convexity in combinatorial structures, etc.) (52B40) Combinatorial aspects of matroids and geometric lattices (05B35)

Abstract: We develop some basic tools to work with representable matroids of bounded tree-width and use them to prove that, for any prime power $q$ and constant $k$, the characteristic polynomial of any loopless, $GF(q)$-representable matroid with tree-width $k$ has no real zero greater than $q^{k-1}$.

Recommendations

• The Zero-Free Intervals for Characteristic Polynomials of Matroids
• Tutte polynomials computable in polynomial time
• scientific article; zbMATH DE number 773196
• Bounding the coefficients of the characteristic polynomials of simple binary matroids
• Linear bounds on characteristic polynomials of matroids

Cites work

• scientific article; zbMATH DE number 5657441 (Why is no real title available?)
• scientific article; zbMATH DE number 4027488 (Why is no real title available?)
• scientific article; zbMATH DE number 67324 (Why is no real title available?)
• scientific article; zbMATH DE number 475579 (Why is no real title available?)
• scientific article; zbMATH DE number 2199828 (Why is no real title available?)
• scientific article; zbMATH DE number 5873618 (Why is no real title available?)
• A Zero-Free Interval for Chromatic Polynomials of Graphs
• Absence of Zeros for the Chromatic Polynomial on Bounded Degree Graphs
• Bounds on the complex zeros of (di)chromatic polynomials and Potts-model partition functions
• COLOURING, PACKING AND THE CRITICAL PROBLEM
• Chromatic Roots are Dense in the Whole Complex Plane
• Computing Tutte polynomials
• Graph minors. II. Algorithmic aspects of tree-width
• Homomorphieeigenschaften und mittlere Kantendichte von Graphen
• Is the five-flow conjecture almost false?
• Matroid tree-width
• Modular Constructions for Combinatorial Geometries
• The Zero-Free Intervals for Chromatic Polynomials of Graphs
• The largest real zero of the chromatic polynomial
• The number of rank-\(k\) flats in a matroid with no \(U_{2, n}\)-minor

Cited in

(2)

• Bounding the coefficients of the characteristic polynomials of simple binary matroids
• Linear bounds on characteristic polynomials of matroids

This page was built for publication: On zeros of the characteristic polynomial of matroids of bounded tree-width

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q338570)