Asymptotic unit hitting time conjecture for primitive geometric lattices
Statement
Let be a sequence of primitive geometric lattices, meaning geometric lattices that cannot be written as products of smaller geometric lattices, and suppose that
Let denote the expected number of steps for the Ungarian Markov chain on to reach its bottom element from its top element. Primitive geometric lattice conjecture. Then
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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.