Techniques in matroid reconstruction
type: Item
instance of: scholarly article
title: Techniques in matroid reconstruction
zbMATH Open document ID: 0878.05020
DOI: 10.1016/0012-365X(95)00227-N
author: William P. Miller
published in: Discrete Mathematics
publication date: 1997-12-07T00:00:00Z
review text: 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.
Mathematics Subject Classification ID: 05B35
zbMATH DE Number: 1047052
zbMATH Keywords: matroid reconstruction
zbMATH Keywords: Dowling lattice
reviewed by: Herman J. Servatius
MaRDI profile type: MaRDI publication profile
cites work: Uniformität des Verbandes der Partitionen
cites work: The geometry of Dowling lattices
cites work: Q3975132
cites work: Graph reconstruction—a survey
cites work: A geometric characterization of Dowling lattices
cites work: Q4053686
cites work: On the nonreconstructibility of combinatorial geometries
cites work: Hyperplane reconstruction of the Tutte polynomial of a geometric lattice
cites work: Q3728007
cites work: Elementary strong maps and transversal geometries
cites work: A class of geometric lattices based on finite groups
cites work: Line-closed combinatorial geometries
cites work: Q5544087
cites work: Varieties of Combinatorial Geometries
cites work: A classification of modularly complemented geometric lattices
cites work: Q3135082
cites work: Characterizations of partition lattices
cites work: Q3926615
cites work: Q3216652
cites work: Q5511350
cites work: Facing up to arrangements: face-count formulas for partitions of space by hyperplanes
cites work: Q3768917
Recommended article: Unique representability and matroid reconstruction
Recommended article: Reconstructibility of Matroid Polytopes
Recommended article: The reconstruction of a matroid from its connectivity function
Recommended article: Q3834085
description: scientific article; zbMATH DE number 1047052