ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let f0=f1=1f_0=f_1=1 and fn=fn−1+fn−2f_n=f_{n-1}+f_{n-2} for n≥2n\geq 2, where fnf_n is the number of elements of rank nn in the Young–Fibonacci lattice. Young–Fibonacci Eeta-win conjecture. For n≥2n\geq 2, the number of Eeta wins of rank nn in the Young–Fibonacci lattice is

fn−2+(−1)n.f_{n-2}+(-1)^n.

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 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.