The canonical join complex

Abstract

In this paper, we study the combinatorics of a certain minimal factorization of the elements in a finite lattice L called the canonical join representation. The join A =w is the canonical join representation of w if A is the unique lowest subset of L satisfying A=w (where "lowest" is made precise by comparing order ideals under containment). When each element in L has a canonical join representation, we define the canonical join complex to be the abstract simplicial complex of subsets A such that 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 L.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…