The canonical join complex

preprint2016arXivOpen access

Abstract

In this paper, we study the combinatorics of a certain minimal factorization of the elements in a finite lattice LL called the canonical join representation. The join ⋁A=w\bigvee A =w is the canonical join representation of ww if AA is the unique lowest subset of LL satisfying ⋁A=w\bigvee A=w (where "lowest" is made precise by comparing order ideals under containment). When each element in LL has a canonical join representation, we define the canonical join complex to be the abstract simplicial complex of subsets AA such that ⋁A\bigvee A is a canonical join representation. We characterize the class of finite lattices whose canonical join complex is flag, and show how the canonical join complex is related to the topology of LL.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.