On the Foundations of Combinatorial Theory II. Combinatorial Geometries

DOI10.1002/sapm1970492109zbMath0231.05024OpenAlexW2466063749MaRDI QIDQ5638340

Henry Crapo, Gian-Carlo Rota

Publication date: 1970

Published in: Studies in Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/sapm1970492109

Mathematics Subject Classification ID

Combinatorial geometries and geometric closure systems (51D20)

Related Items (59)

The Shi arrangement and the Ish arrangement ⋮ The Broken-Circuit Complex ⋮ Questions about linear spaces ⋮ Line-closed combinatorial geometries ⋮ On pseudomodular matroids and adjoints ⋮ Latroids and their representation by codes over modules ⋮ Alternating Basis Exchanges in Matroids ⋮ Infinite Matroids ⋮ Locally finite complexes, modules and generalized information systems ⋮ Weak Cuts of Combinatorial Geometries ⋮ A Generalisation of the Matroid Lift Construction ⋮ Semimodular Functions and Combinatorial Geometries ⋮ Varieties of Topological Geometries ⋮ Beyond abstract elementary classes: on the model theory of geometric lattices ⋮ Unnamed Item ⋮ On the Wilson monoid of a pairwise balanced design ⋮ On a covering problem of Mullin and Stanton for binary matroids ⋮ Weighted subspace designs from \(q\)-polymatroids ⋮ Existence Theorems for Matroid Designs ⋮ The Slimmest Geometric Lattices ⋮ On Connectivity in Matroids and Graphs ⋮ A Helly type theorem for abstract projective geometries ⋮ A unique exchange property for bases ⋮ Vertex-weighted digraphs and freeness of arrangements between Shi and Ish ⋮ The presence of lattice theory in discrete problems of mathematical social sciences. Why. ⋮ Basis graphs of pregeometries ⋮ A Combinatorial Model for Series-Parallel Networks ⋮ A Decomposition for Combinatorial Geometries ⋮ Matching Theory for Combinatorial Geometries ⋮ Varieties of Combinatorial Geometries ⋮ On the number of matroids compared to the number of sparse paving matroids ⋮ Enumerating matroids of fixed rank ⋮ A mad day’s work: from Grothendieck to Connes and Kontsevich The evolution of concepts of space and symmetry ⋮ Growth Rates and Critical Exponents of Classes of Binary Combinatorial Geometries ⋮ Properties of rank preserving weak maps ⋮ Matching theorems for combinatorial geometries ⋮ A Multiple Exchange Property for Bases ⋮ A combinatorial perspective on algebraic geometry ⋮ The class of non-Desarguesian projective planes is Borel complete ⋮ On the matroid stratification of Grassmann varieties, specialization of coordinates, and a problem of N. White ⋮ Three-way arrays: rank and uniqueness of trilinear decompositions, with application to arithmetic complexity and statistics ⋮ Why the characteristic polynomial factors ⋮ Matroid Designs of Prime Power Index ⋮ Whitney Number Inequalities for Geometric Lattices ⋮ Modular Constructions for Combinatorial Geometries ⋮ On Fundamental Transversal Matroids ⋮ The Factorization and Representation of Lattices ⋮ The Bracket Ring of a Combinatorial Geometry. I ⋮ Modular elements of geometric lattices ⋮ The number of partially ordered sets ⋮ Electrical networks and hyperplane arrangements ⋮ Combinatorial analysis. (Matrix problems, choice theory) ⋮ Varieties and universal models in the theory of combinatorial geometries ⋮ On cohomology algebras of complex subspace arrangements ⋮ A Catalogue of Combinatorial Geometries ⋮ Weak Maps of Combinatorial Geometries ⋮ Whitney numbers of matroid extensions and co-extensions ⋮ On D-complementation ⋮ The number of partial Steiner systems and d-partitions

This page was built for publication: On the Foundations of Combinatorial Theory II. Combinatorial Geometries