Now showing items 1-4 of 4

  • Computing various types of lattices freely generated by posets 

    Wild, Marcel (Edizioni CERFIM Centro di Ricerche in Fisica e MatematicaResearch Center for Mathematics and Physics - Locarno - Switzerland, 2000)
    see item for abstract

  • Enumeration problems on lattices 

    Ocansey, Evans Doe (Stellenbosch : Stellenbosch University, 2013-03)
    ENGLISH ABSTRACT: The main objective of our study is enumerating spanning trees (G) and perfect matchings PM(G) on graphs G and lattices L. We demonstrate two methods of enumerating spanning trees of any connected ...

  • On the computation of freely generated modular lattices 

    Semegni, Jean Yves (Stellenbosch : Stellenbosch University, 2008-12)
    Please refer to full text for abstract.

  • Relational representations for bounded lattices with operators 

    Goosen, Gerrit (Stellenbosch : University of Stellenbosch, 2010-03)
    ENGLISH ABSTRACT: Within lattice theory, an interesting question asked is whether a given abstract lattice may be represented concretely as subsets of a closure system on a topological space. This is true for boolean ...