加载中…
We develop some basic tools to work with representable matroids of bounded tree-width and use them to prove that, for any prime power and constant , the characteristic polynomial of any loopless, -representable matroid with tree-width has no real zero greater than .

生成讲解博客的中文版本

生成AI智能校验的中文版本