ProbXiv
Explorersign in
Problem archiveProblem record

Statement

For n≥1n\ge1, let YFn\mathbb{YF}_n be the set of Fibonacci words of weight nn. For u,v∈YFnu,v\in\mathbb{YF}_n, let Nu,vN_{u,v} be the corresponding multiplicity, and arrange these entries in lexicographic order into the matrix Nn\mathrm{\bf N}_n. Write u⪰vu\succeq v for the dominance order on Fibonacci words, and let h(w)\mathcal{h}(w) denote the total hike, the number of 22's appearing in ww.

Multiplicity-matrix conjecture. The matrix Nn\mathrm{\bf N}_n is upper triangular. Furthermore, if Nu,vN_{u,v} is nonzero, then u⪰vu\succeq v and h(u)=h(v)\mathcal{h}(u)=\mathcal{h}(v). This conjecture predicts a triangularity and dominance structure for the multiplicities arising in the Fibonacci-word expansion of the moments. The source gives no resolution status, so it remains open.

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.