ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let L\mathcal{L} be an atomistic lattice with maximum element 1\mathbf{1} and set of atoms A(L)A(\mathcal{L}). For a subset H⊆A(L)H\subseteq A(\mathcal{L}), write ⋁H\bigvee H for its join.

Atomistic-lattice hull-number conjecture. The minimum size of a subset H⊆A(L)H\subseteq A(\mathcal{L}) such that

⋁H=1\bigvee H=\mathbf{1}

can be computed in polynomial time.

The preceding proposition gives a quasi-polynomial-time algorithm by bounding the hull number in terms of the logarithm of the lattice size, assuming joins can be computed in polynomial time. The conjecture generalizes the corresponding question for linear extension graphs and would provide a polynomial-time method for this lattice optimization problem.

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.