ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let L(n)L^{(n)} be a sequence of primitive geometric lattices, meaning geometric lattices that cannot be written as products of smaller geometric lattices, and suppose that

∣L(n)∣→∞as n→∞.\lvert L^{(n)}\rvert\to\infty\quad\text{as }n\to\infty.

Let E(L(n))\mathcal E(L^{(n)}) denote the expected number of steps for the Ungarian Markov chain on L(n)L^{(n)} to reach its bottom element from its top element. Primitive geometric lattice conjecture. Then

E(L(n))=1+o(1).\mathcal E(L^{(n)})=1+o(1).

Geometric lattices are precisely the lattices of flats of matroids, and primitive geometric lattices correspond to connected matroids. The source proposes this asymptotic behavior as a future direction and gives no resolution.

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.