ProbXiv
Explorersign in
Problem archiveProblem record

Statement

For a finite undirected graph GG, let B\mathsf{B} be the graphical pointed building set of GG, and let Bicl⁡(B)\operatorname{Bicl}(\mathsf{B}) denote the subposet of biclosed ornamentations in O(B)\mathcal{O}(\mathsf{B}). Graphical biclosed ornamentation lattice conjecture. The poset

Bicl⁡(B)\operatorname{Bicl}(\mathsf{B})

is a lattice. The claim is motivated by several natural examples in which this poset is a lattice, while the paper notes that it is not a lattice for arbitrary pointed building sets; whether the graphical case always has this property remains open.

Record

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.