Dominance-order conjecture for the Fibonacci-word multiplicity matrix
For , let be the set of Fibonacci words of weight . For , let be the corresponding multiplicity, and arrange these entries in lexicographic order into the matrix . Write for the dominance order on Fibonacci words, and let denote the total hike, the number of 's appearing in .
Multiplicity-matrix conjecture. The matrix is upper triangular. Furthermore, if is nonzero, then and . 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
- Leonid Petrov and Jeanne Scott, “Random Fibonacci Words via Clone Schur Functions”, arXiv:2412.21126 (2025).
Progress summary
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.