Skip to main content Accessibility help
×
Home

Linear bounds on characteristic polynomials of matroids

  • SUIJIE WANG (a1), YEONG–NAN YEH (a2) and FENGWEI ZHOU (a3)

Abstract

Let χ(t) = a0tna1tn−1 + ⋯ + (−1)rartnr be the chromatic polynomial of a graph, the characteristic polynomial of a matroid, or the characteristic polynomial of an arrangement of hyperplanes. For any integer k = 0, 1, …, r and real number xkr − 1, we obtain a linear bound of the coefficient sequence, that is

\begin{align*} {r+x\choose k}\leqslant \sum_{i=0}^{k}a_{i}{x\choose k-i}\leqslant {m+x\choose k}, \end{align*}
where m is the size of the graph, matroid, or hyperplane arrangement. It extends Whitney’s sign-alternating theorem, Meredith’s upper bound theorem, and Dowling and Wilson’s lower bound theorem on the coefficient sequence. In the end, we also propose a problem on the combinatorial interpretation of the above inequality.

Copyright

Footnotes

Hide All

This work was supported by the National Natural Science Foundation of China (11871204).

Footnotes

References

Hide All
[1]Adiprasto, K.,Huh, J. andKatz, E.. Hodge theory for combinatorial geometries. arXiv:1511.02888.
[2]Chari, M. K.. Two decompositions in topological combinatorics with applications to matroid complexes. Trans. Am. Math. Soc. 349 (1997), 39253943.
[3]D’Adderio, M.,Moci, L. and Arithmetic matroids. The Tutte polynomial and toric arrangement. Adv. Math. 232 (2013), 335367.
[4]Dowling, T. A. andWilson, R. M.. The slimmest geometric lattices. Trans. Am. Math. Soc. 196 (1974), 203215.
[5]Hibi, T.. Face number inequalities for matroid complexes and Cohen–Macaulay types of Stanley–Reisner rings of distributive lattices. Pac. J. Math. 154 (1992), no. 2, 253264.
[6]Lenz, M.. The f-vector of a representable-matroid complex is log-concave. Adv. Appl. Math. 51 (2013), no. 5, 543545.
[7]Huh, J.. Milnor numbers of projective hypersurfaces and the chromatic polynomial of graphs. J. Am. Math. Soc. 25 (2012), 907927.
[8]Huh, J. andKatz, E.. Log-concavity of characteristic polynomials and Bergman fan of matroids. Math. Ann. 354 (2012), 11031116.
[9]Huh, J.. h-vectors of matroids and logarithmic concavity. Adv. Math. 270 (2015), 4959.
[10]Meredith, G. H. J.. Coefficients of chromatic polynomials. J. Combin. Theory Ser. B 13 (1972), 1417.
[11]Moci, L.. A Tutte polynomial for toric arrangements. Trans. Am. Math. Soc. 364 (2012) 10671088.
[12]Orlik, P. andTerao, H.. Arrangements of Hyperplanes (Springer–Verlag, Berlin, 1992).
[13]Oxley, J. G.. Matroid Theory (Oxford University Press, Oxford, 2011).
[14]Read, R. C.. An introduction to chromatic polynomials. J. Comb. Theory 4 (1968), 5271. MR0224505(37:104).
[15]Swartz, E.. Lower bounds for h-vectors of k-CM, independence, and broken circuit complexes. SIAM J. Discrete Math. 18 (2004/05), no. 3, 647661.
[16]Stanley, R. P.. An introduction to hyperplane arrangements. In: edited byMiller, E.,Reiner, V.,Sturmfels, B.. Geometric Combinatorics. IAS/Park City Math. Ser., vol. 13. (American Mathematical Society, Providence, RI, 2007), 389496.
[17]Wagner, D. G.. Negatively correlated random variables and Mason’s conjecture for independent sets in matroids. Ann. Comb. 12 (2008), no. 2, 211239.
[18]White, N.. Theory of Matroids. In: Encyclopedia of Mathematics and its Applications, vol. 26. (Cambridge University Press, Cambridge, 1986).
[19]Whitney, H.. A logical expansion in mathematics. Bull. Am. Math. Soc. 38 (1932), 572579.
[20]Whitney, H.. The coloring of graphs. Ann. Math. 33 (1932), no. 2, 688718.
[21]Whitney, H.. On the abstract properties of linear dependence. Am. J. Math. 57 (1935) 509533.
[22]Wilf, H. S.. Which polynomials are chromatic? Colloquio Internazionale sulle Teorie Combinatorie (1976), 247256.
[23]Zaslavsky, T.. Facing up to arrangements: Face-count formulas for partitions of space by hyperplanes. Mem. Am. Math. Soc. 1 (1975) no. 154.

Linear bounds on characteristic polynomials of matroids

  • SUIJIE WANG (a1), YEONG–NAN YEH (a2) and FENGWEI ZHOU (a3)

Metrics

Full text views

Total number of HTML views: 0
Total number of PDF views: 0 *
Loading metrics...

Abstract views

Total abstract views: 0 *
Loading metrics...

* Views captured on Cambridge Core between <date>. This data will be updated every 24 hours.

Usage data cannot currently be displayed.