ProbXiv
Explorersign in
Problem archiveProblem record

Statement

A Dyck-like lattice is a distributive lattice whose spectrum is a ranked poset admitting a labelling of its elements with the following properties: all labels are positive integers and every antichain of join-irreducibles can be linearly ordered so that the labels of its elements are distinct and, if the first and last elements have minimum and maximum labels, respectively, then their meet equals the meet of all elements in the antichain. For a,b∈Na,b\in\mathbb{N}, let Dn(a,b)\mathcal{D}_n^{(a,b)} denote the lattice of Dyck-like paths of length nℓ(a,b)n\ell(a,b).

Converse representation conjecture. Every finite Dyck-like lattice can be represented as a sublattice of a lattice of Dyck-like paths of suitable length.

The conjecture proposes a converse to the preceding proposition that every lattice Dn(a,b)\mathcal{D}_n^{(a,b)} is Dyck-like. It concerns whether the class of finite Dyck-like lattices is exhausted, up to sublattice representation, by lattices arising from Dyck-like paths.

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.