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

From MaRDI portal
Publication:338570

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 qk1.


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





Cites Work







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)