On zeros of the characteristic polynomial of matroids of bounded tree-width
classification
🧮 math.CO
keywords
tree-widthboundedcharacteristicmatroidspolynomialrepresentablebasicconstant
read the original 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}$.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.