Techniques in matroid reconstruction
The question of whether the isomorphism class of a finite simple graph is determined by its set (or ``deck) of induced subgraphs is a fundamental open question in graph theory. The matroid analogues and generalizations of this question, reconstruction matroids or their invariants, are both natural and important. Roughly speaking, one may show a graph or matroid is reconstructible if either, on the one hand, there is a recognizable local structure that can be used as a benchmark, e.g. an isthmus, or there is a global regularity condition that aides in the reconstruction, e.g. \(k\)-valent graphs. The main result of this paper, that the matroids of Dowling lattices are reconstructible from their decks of hyperplanes, falls in the latter class, while the proof techniques fall in the former. The paper also contains a readable introduction to the problem, a discussion of general techniques, and many references.
- A class of geometric lattices based on finite groups
- A classification of modularly complemented geometric lattices
- A geometric characterization of Dowling lattices
- Characterizations of partition lattices
- Elementary strong maps and transversal geometries
- Facing up to arrangements: face-count formulas for partitions of space by hyperplanes
- Graph reconstruction—a survey
- scientific article; zbMATH DE number 420868 (Why is no real title available?)
- scientific article; zbMATH DE number 3882430 (Why is no real title available?)
- scientific article; zbMATH DE number 3959442 (Why is no real title available?)
- scientific article; zbMATH DE number 4027488 (Why is no real title available?)
- scientific article; zbMATH DE number 3739586 (Why is no real title available?)
- scientific article; zbMATH DE number 17789 (Why is no real title available?)
- scientific article; zbMATH DE number 3468874 (Why is no real title available?)
- scientific article; zbMATH DE number 3222869 (Why is no real title available?)
- scientific article; zbMATH DE number 3258862 (Why is no real title available?)
- Hyperplane reconstruction of the Tutte polynomial of a geometric lattice
- Line-closed combinatorial geometries
- On the nonreconstructibility of combinatorial geometries
- The geometry of Dowling lattices
- Uniformität des Verbandes der Partitionen
- Varieties of Combinatorial Geometries
- Unique representability and matroid reconstruction
- T-uniqueness of some families of \(k\)-chordal matroids
- Characterizing combinatorial geometries by numerical invariants
- scientific article; zbMATH DE number 4110734 (Why is no real title available?)
- Reconstructibility of matroid polytopes
- Characterizations of \(\text{PG}(n-1,q)\setminus\text{PG}(k-1,q)\) by numerical and polynomial invariants
This page was built for publication: Techniques in matroid reconstruction
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1363660)
