Intersection Theory for Embeddings of Matroids into Uniform Geometries

DOI10.1002/sapm1979613211zbMath0478.05022OpenAlexW2551352699MaRDI QIDQ3934400

Tom Brylawski

Publication date: 1979

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

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

zbMATH Keywords

codescritical problemfinite projective spacesgeometric latticeslinear geometriescombinatorial intersection theory

Mathematics Subject Classification ID

Combinatorial aspects of finite geometries (05B25) Combinatorial aspects of matroids and geometric lattices (05B35)

Related Items (10)

A class of rank-invariants for perfect matroid designs ⋮ Some properties of characteristic polynomials and applications to T- lattices ⋮ Intersection theory for graphs ⋮ The Tutte polynomial of some matroids ⋮ Arrangements, channel assignments, and associated polynomials ⋮ Characterizing combinatorial geometries by numerical invariants ⋮ Tutte polynomials of generalized parallel connections ⋮ A MacWilliams type identity for matroids ⋮ Characterizations of \(\text{PG}(n-1,q)\setminus\text{PG}(k-1,q)\) by numerical and polynomial invariants ⋮ Matroid representations by partitions

Cites Work

• Unnamed Item
• On the nonreconstructibility of combinatorial geometries
• Steiner quadruple systems - a survey
• Möbius inversion in lattices
• Modular elements of geometric lattices
• A class of geometric lattices based on finite groups
• Uniformität des Verbandes der Partitionen
• Modular Constructions for Combinatorial Geometries
• Weight Enumeration and the Geometry of Linear Codes
• A Decomposition for Combinatorial Geometries
• [https://portal.mardi4nfdi.de/wiki/Publication:5731810 On the foundations of combinatorial theory I. Theory of M�bius Functions]

This page was built for publication: Intersection Theory for Embeddings of Matroids into Uniform Geometries