Total polynomials of uniform oriented matroids

DOI10.1006/eujc.1999.0322zbMath0981.52018OpenAlexW1991419084MaRDI QIDQ1964645

James F. Lawrence

Publication date: 22 June 2000

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/c1cfb348c1ae7f388d605c344133551d1d2801b5

zbMATH Keywords

combinatorial geometry\(k\)-setsenumeration problemsuniform oriented matroidscounting faces of polytopesRadon partitions

Mathematics Subject Classification ID

Arrangements of points, flats, hyperplanes (aspects of discrete geometry) (52C35) Combinatorial aspects of matroids and geometric lattices (05B35) Oriented matroids in discrete geometry (52C40)

Related Items (2)

The odd--even invariant of an oriented matroid ⋮ On the conjectured upper bounds for entries of mutation count matrices

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A combinatorial perspective on the non-Radon partitions
• Determining a matroid polytope by non-Radon partitions
• The number of faces of a simplicial convex polytope
• A proof of the sufficiency of McMullen's conditions for f-vectors of simplicial convex polytopes
• Oriented matroids
• A combinatorial perspective on the Radon convexity theorem
• The numbers of faces of simplicial polytopes
• On the number of halving planes
• Facing up to arrangements: face-count formulas for partitions of space by hyperplanes
• A Short Proof of Euler’s Relation for Convex Polytopes
• Partition of Space

This page was built for publication: Total polynomials of uniform oriented matroids