Eccentricity, Center and Radius Computations on the Cover Graphs of Distributive Lattices with Applications to Stable Matchings Christine T. Cheng2 , Eric McDermid3 , Ichiro Suzuki4 Abstract

Source URL: www.cs.uwm.edu

• Matching
• Lattice theory
• Combinatorial optimization
• Lattice
• Distributive lattice
• Duality
• Computational problems
• FKT algorithm
• Congruence lattice problem

The center stable matchings and the centers of cover graphs of distributive lattices Christine T. Cheng∗ Eric McDermid†

Source URL: www.cs.uwm.edu

• Matching
• Lattice theory
• Combinatorial optimization
• Lattice
• Duality
• Bipartite graph
• Distributive lattice
• 3-dimensional matching
• Keyword cipher

Lifters, free sets, ladders The Conc functor k-ladders

Source URL: spot.colorado.edu

• Lattice theory
• Mathematics
• Algebraic structures
• Structure
• Semilattice
• Distributive lattice
• Lattice
• Functor
• Congruence lattice problem
• Distributive homomorphism

Characterizing algebras and varieties by weak congruence lattices and open problems ˇ selja Andreja Tepavˇcevi´c and Branimir Seˇ Department of Mathematics and Informatics, Faculty of Sciences

Source URL: spot.colorado.edu

• Lie groups
• Algebra
• Lattice theory
• Congruence relation
• Modular arithmetic
• Compact element
• Quotient algebra
• Congruence
• Lattice
• Congruence lattice problem
• Distributive homomorphism

Denitions and construction Topologies on canonical extensions Subspace topologies Canonical extensions of lattices Andrew Craig

Source URL: spot.colorado.edu

• Lattice theory
• Lattice
• Complete lattice
• Dual space
• Distributive lattice
• Topological space
• Congruence lattice problem

A distributive lattice with non-modular MacNeille completion L L

Source URL: math.chapman.edu

PROFINITE COMPLETIONS AND CANONICAL EXTENSIONS OF SEMILATTICE REDUCTS OF DISTRIBUTIVE LATTICES M.J. GOUVEIA AND H.A. PRIESTLEY Abstract. A bounded distributive lattice L has two unital semilattice reducts, denoted L∧ a

Source URL: people.maths.ox.ac.uk

Cubical Type Theory Free bounded distributive lattice The free distributive lattice on a set J can be described as the set of finite antichains in the poset of finite subsets of J, for the order L 6 M if, and only if, f

Source URL: www.cse.chalmers.se

DISTRIBUTIVITY OF THE NORMAL COMPLETION, AND ITS PRIESTLEY REPRESENTATION ˇ PULTR RICHARD N. BALL AND ALES Abstract. The normal, or Dedekind-MacNeille, completion δ(L) of a distributive lattice L need not be distributi

Source URL: iti.mff.cuni.cz

Cubical Type Theory Free bounded distributive lattice The free distributive lattice on a set J can be described as the set of finite antichains in the poset of finite subsets of J, for the order L 6 M if, and only if, f

Source URL: www.cse.chalmers.se