Abstract | ||
---|---|---|
A geometric lattice is a frame if its matroid, possibly after enlargement, has a basissuch that every atom lies under a join of at most two basis elements. Examples include allsubsets of a classical root system. Using the fact that finitary frame matroids are the biasmatroids of biased graphs, we characterize modular coatoms in frames of finite rank andwe describe explicitly the frames that are supersolvable. We apply the characterizationsto three kinds of example: one generalizes the root ... |
Year | DOI | Venue |
---|---|---|
2001 | 10.1006/eujc.2000.0418 | Eur. J. Comb. |
Keywords | Field | DocType |
graphic-lift lattice,supersolvable frame-matroid,root system | Matroid,Discrete mathematics,Lift (force),Graph,Combinatorics,Lattice (order),Geometric lattice,Finitary,Graphic matroid,Modular design,Mathematics | Journal |
Volume | Issue | ISSN |
22 | 1 | 0195-6698 |
Citations | PageRank | References |
4 | 0.87 | 4 |
Authors | ||
1 |
Name | Order | Citations | PageRank |
---|---|---|---|
T. Zaslavsky | 1 | 297 | 56.67 |