The canonical join complex
Combinatorics
2016-10-18 v1
Abstract
In this paper, we study the combinatorics of a certain minimal factorization of the elements in a finite lattice called the canonical join representation. The join is the canonical join representation of if is the unique lowest subset of satisfying (where "lowest" is made precise by comparing order ideals under containment). When each element in has a canonical join representation, we define the canonical join complex to be the abstract simplicial complex of subsets such that 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 .
Cite
@article{arxiv.1610.05137,
title = {The canonical join complex},
author = {Emily Barnard},
journal= {arXiv preprint arXiv:1610.05137},
year = {2016}
}
Comments
26 pages, 12 figures