- Dual digraphs of finite meet-distributive and modular lattices
Number of the records: 1  

Dual digraphs of finite meet-distributive and modular lattices

  1. TitleDual digraphs of finite meet-distributive and modular lattices
    Author infoAndrew Craig ... [et al.]
    Author Craig Andrew, P. K. (34%)
    Co-authors Haviar Miroslav 1965- (33%) UMBFP10 - Katedra matematiky
    Marais Klarise (33%)
    Source document Cubo : a mathematical journal. Vol. 26, no. 2 (2024), pp. 279-302. - Temuco : Department of mathematics and statistics of the Universidad de La Frontera, 2024
    Keywords matematika - mathematics   algebra - algebra   teória zväzov   geometria - geometry  
    Form. Descr.články - journal articles
    LanguageEnglish
    CountryChile
    AnnotationWe describe the digraphs that are dual representations of finite lattices satisfying conditions related to meet-distributivity and modularity. This is done using the dual digraph representation of finite lattices by Craig, Gouveia and Haviar (2015). These digraphs, known as TiRS digraphs, have their origins in the dual representations of lattices by Urquhart (1978) and Ploščica (1995). We describe two properties of finite lattices which are weakenings of (upper) semimodularity and lower semimodularity respectively, and then show how these properties have a simple description in the dual digraphs. Combined with previous work in this journal on dual digraphs of semidistributive lattices (2022), it leads to a dual representation of finite meet-distributive lattices. This provides a natural link to finite convex geometries. In addition, we present two sufficient conditions on a finite TiRS digraph for its dual lattice to be modular. We close by posing four open problems.
    URLLink na zdrojový dokument
    Public work category ADM
    No. of Archival Copy54691
    Catal.org.BB301 - Univerzitná knižnica Univerzity Mateja Bela v Banskej Bystrici
    Databasexpca - PUBLIKAČNÁ ČINNOSŤ
    ReferencesPERIODIKÁ-Súborný záznam periodika
Number of the records: 1  

  This site uses cookies to make them easier to browse. Learn more about how we use cookies.