Linear bounds on characteristic polynomials of matroids
DOI10.1017/S0305004118000919zbMATH Open1446.05013OpenAlexW2977259980MaRDI QIDQ5115544FDOQ5115544
Authors: Suijie Wang, Yeong-Nan Yeh, Fengwei Zhou 
Publication date: 16 August 2020
Published in: Mathematical Proceedings of the Cambridge Philosophical Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1017/s0305004118000919
Recommendations
- Bounding the coefficients of the characteristic polynomials of simple binary matroids
- Hodge theory for combinatorial geometries
- Sign-Coherent Identities for Characteristic Polynomials of Matroids
- scientific article; zbMATH DE number 4025458
- On zeros of the characteristic polynomial of matroids of bounded tree-width
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) Arrangements of points, flats, hyperplanes (aspects of discrete geometry) (52C35)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- A Tutte polynomial for toric arrangements
- A logical expansion in mathematics
- An introduction to chromatic polynomials
- An introduction to hyperplane arrangements
- Arithmetic matroids, the Tutte polynomial and toric arrangements
- Coefficients of chromatic polynomials
- Face number inequalities for matroid complexes and Cohen-Macaulay types of Stanley-Reisner rings of distributive lattices
- Facing up to arrangements: face-count formulas for partitions of space by hyperplanes
- Log-concavity of characteristic polynomials and the Bergman fan of matroids
- Lower Bounds forh-Vectors ofk-CM, Independence, and Broken Circuit Complexes
- Milnor numbers of projective hypersurfaces and the chromatic polynomial of graphs
- Negatively correlated random variables and Mason's conjecture for independent sets in matroids
- On the Abstract Properties of Linear Dependence
- The Slimmest Geometric Lattices
- The \(f\)-vector of a representable-matroid complex is log-concave
- Theory of Matroids
- Two Decompositions in Topological Combinatorics with Applications to Matroid Complexes
- \( h\)-vectors of matroids and logarithmic concavity
Cited In (7)
- Strictness of the log-concavity of generating polynomials of matroids
- New perspectives on polynomial invariants
- Möbius and coboundary polynomials for matroids
- Bounding the coefficients of the characteristic polynomials of simple binary matroids
- Title not available (Why is that?)
- On zeros of the characteristic polynomial of matroids of bounded tree-width
- Truncation Technique for Characterizing Linear Polymatroids
This page was built for publication: Linear bounds on characteristic polynomials of matroids
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5115544)
