Hostname: page-component-84b7d79bbc-g5fl4 Total loading time: 0 Render date: 2024-07-26T15:10:07.870Z Has data issue: false hasContentIssue false
  • English
  • Français

Sign-Coherent Identities for Characteristic Polynomials of Matroids

Published online by Cambridge University Press:  12 September 2008

Joseph P. S. Kung
Joseph P. S. Kung
Affiliation:
Department of Mathematics, University of North Texas, Denton, Texas 76203, U.S.A.
Get access Rights & Permissions [Opens in a new window]

Abstract

We derive an explicit formula for the difference χ(G;λ) − χ(G|X;λ)χ(Tx(G); λ)/(λ − 1), where χ(G;λ) is the characteristic polynomial of a simple matroid G, G|X is the restriction of G to a flat X in G, and Tx(G) is the complete principal truncation of G at the flat X. Two counting proofs of this formula are given. The first uses the critical problem and the second uses the broken-circuit complex. We also derive several inequalities involving Whitney numbers of the first kind and other numerical invariants.

Type
Research Article
Information
Combinatorics, Probability and Computing , Volume 2 , Issue 1 , March 1993 , pp. 33 - 51
Copyright
Copyright © Cambridge University Press 1993

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

[1]Brown, T. (1974) Transversal theory and F-products. J. Combin. Theory Ser. A 17 290–298.Google Scholar
[2]Brylawski, T. (1975) Modular constructions for combinatorial geometries. Trans. Amer. Math. Soc. 203 1–44.CrossRefGoogle Scholar
[3]Brylawski, T. (1977) The broken-circuit complex. Trans. Amer. Math. Soc. 234 243–252.Google Scholar
[4]Brylawski, T. (1986) Blocking sets and Möbius functions. In: Symposia Mathematica 28 (Rome, 1983), Academic Press, London-New York, 231–249.Google Scholar
[5]Brylawski, T. (1986) Constructions. In: White, N. L. (ed.) Theory of matroids, Cambridge University Press, 127–223.Google Scholar
[6]Brylawski, T. and Oxley, J. G. (1980) Several identities for the characteristic polynomial of a combinatorial geometry. Discrete Math. 31 161–170.CrossRefGoogle Scholar
[7]Brylawski, T. and Oxley, J. G. (1981) The broken-circuit complex: its structure and factorization. Europ. J. Combin. 2 107–121.CrossRefGoogle Scholar
[8]Brylawski, T. and Oxley, J. G. (1992) The Tutte polynomial and its applications. In: White, N. L. (ed.) Matroid applications, Cambridge University Press, 123–225.CrossRefGoogle Scholar
[9]Crapo, H. H. (1967) A higher invariant for matroids. J. Combin. Theory 2 406–417.CrossRefGoogle Scholar
[10]Crapo, H. H. and Rota, G.-C. (1970) On the foundations of combinatorial theory: Combinatorial geometries, M. I. T. Press, Cambridge, Mass.Google Scholar
[11]Greene, C. (1975) An inequality for the Möbius function of a geometric lattice. Stud. Appl. Math. 54 71–74.Google Scholar
[12]Greene, C. and Zaslavsky, T. (1983) On the interpretation of Whitney numbers through arrangements of hyperplanes, zonotopes, non-Radon partitions, and orientations of graphs. Trans. Amer. Math. Soc. 280 97–126.Google Scholar
[13]Kung, J. P. S. (1986) Strong maps. In: White, N. L. (ed.) Theory of matroids, Cambridge University Press, 224–253.Google Scholar
[14]Kung, J. P. S. (1990) The long-line graph of a combinatorial geometry. II. Geometries representable over two fields of different characteristics. J. Combin. Theory, Ser. B 50 41–52.Google Scholar
[15]Kung, J. P. S. (to appear) Flags and Whitney numbers of matroids. J. Combin. Theory, Ser. B.Google Scholar
[16]Oxley, J. G. (1978) Colouring, packing and the critical problem. Quart. J. Math. Oxford (2) 29 11–22.Google Scholar
[17]Oxley, J. G. (1983) On a matroid identity. Discrete Math. 44 55–60.CrossRefGoogle Scholar
[18]Oxley, J. G. (1992) Matroid theory, Oxford University Press.Google Scholar
[19]Rota, G.-C. (1964) On the foundations of combinatorial theory. I. Theory of Möbius functions. Z. Wahrsch. Verw. Gebiete 2 340–368.Google Scholar
[20]Stanley, R. P. (1971) Acyclic orientations of graphs. Discrete Math. 5 171–178.Google Scholar
[21]Stanley, R. P. (1971) Modular elements of geometric lattices. Algebra Universalis 1 214–217.CrossRefGoogle Scholar
[22]Stanley, R. P. (1972) Supersolvable lattices. Algebra Universalis 2 197–217.Google Scholar
[23]Weisner, L. (1935) Abstract theory of inversion of finite series. Trans. Amer. Math. Soc. 38 474–484.Google Scholar
[24]Welsh, (D. J. A.) (1976) Matroid Theory, Academic Press, London.Google Scholar
[25]White, N. L. (ed.) (1985) Theory of matroids, Cambridge University Press.Google Scholar
[26]White, N. L. (ed.) (1986) Combinatorial geometries, Cambridge University Press.Google Scholar
[27]White, N. L. (ed.) (1992) Matroid applications, Cambridge University Press.Google Scholar
[28]Whitney, H. (1932) The coloring of graphs. Ann. Math. (2) 33 688–718.CrossRefGoogle Scholar
[29]Zaslavsky, T. (1987) The Möbius function and the characteristic polynomial. In: White, N. L. (ed.) Combinatorial geometries, Cambridge University Press, 114–138.CrossRefGoogle Scholar