English

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 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.

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

R2 v1 2026-06-22T16:22:57.069Z