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

DOI10.1016/J.EJC.2016.08.011zbMATH Open1348.05047arXiv1703.02393OpenAlexW2521065696MaRDI QIDQ338570FDOQ338570

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

Publication date: 7 November 2016

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

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}$.

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

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

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)

Cites Work

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

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)