Eeta-win enumeration in the Young–Fibonacci lattice
Statement
Let and for , where is the number of elements of rank in the Young–Fibonacci lattice. Young–Fibonacci Eeta-win conjecture. For , the number of Eeta wins of rank in the Young–Fibonacci lattice is
The conjecture proposes an explicit enumeration for Eeta wins in a lattice that is similar to Young's lattice but is not distributive. Its resolution is not given in the supplied text.
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.