Line-closed combinatorial geometries (Q1088668): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q3050437 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3941433 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5331549 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3864533 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Foundations of Combinatorial Theory II. Combinatorial Geometries / rank
 
Normal rank
Property / cites work
 
Property / cites work: A class of geometric lattices based on finite groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two Embedding Theorems for Finite Lattices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Varieties of Combinatorial Geometries / rank
 
Normal rank
Property / cites work
 
Property / cites work: A classification of modularly complemented geometric lattices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5815957 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Supersolvable lattices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modularity complemented geometric lattices / rank
 
Normal rank

Latest revision as of 17:46, 17 June 2024

scientific article
Language Label Description Also known as
English
Line-closed combinatorial geometries
scientific article

    Statements

    Line-closed combinatorial geometries (English)
    0 references
    0 references
    1987
    0 references
    We present some results on combinatorial geometries (geometric lattices) in which closure is line-closure. We prove that every interval of a line- closed geometry is line-closed. Furthermore, if every rank 3 interval of a geometry is line-closed, then the geometry is line-closed. This implies that every supersolvable geometry is line-closed. Though not true in general, supersolvability does characterize the line-closed graphic geometries.
    0 references
    combinatorial geometries
    0 references
    geometric lattices
    0 references

    Identifiers