← All problems

Dominance-order conjecture for the Fibonacci-word multiplicity matrix

2 years old · traced to

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.

References
  1. Leonid Petrov and Jeanne Scott, “Random Fibonacci Words via Clone Schur Functions”, arXiv:2412.21126 (2025).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.