Sign-Coherent Identities for Characteristic Polynomials of Matroids

DOI10.1017/S096354830000047XzbMath0796.05022OpenAlexW2153297152MaRDI QIDQ4289305

Joseph P. S. Kung

Publication date: 5 September 1994

Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s096354830000047x

zbMATH Keywords

characteristic polynomialmodular flatgeometric latticesBrown truncation

Mathematics Subject Classification ID

Combinatorial aspects of matroids and geometric lattices (05B35)

Related Items

Modular decomposition of the Orlik-Terao algebra, The absolute order of a permutation representation of a Coxeter group

Cites Work

• Unnamed Item
• The long-line graph of a combinatorial geometry. II: Geometries representable over two fields of different characteristics
• Several identities for the characteristic polynomial of a combinatorial geometry
• The broken-circuit complex: its structure and factorizations
• Transversal theory and F-products
• The coloring of graphs
• On a matroid identity
• Modular elements of geometric lattices
• Supersolvable lattices
• Acyclic orientations of graphs
• On the Interpretation of Whitney Numbers Through Arrangements of Hyperplanes, Zonotopes, Non-Radon Partitions, and Orientations of Graphs
• Modular Constructions for Combinatorial Geometries
• An Inequality for the Möbius Function of a Geometric Lattice
• The Broken-Circuit Complex
• COLOURING, PACKING AND THE CRITICAL PROBLEM
• A higher invariant for matroids
• [https://portal.mardi4nfdi.de/wiki/Publication:5731810 On the foundations of combinatorial theory I. Theory of M�bius Functions]
• Abstract Theory of Inversion of Finite Series