Dominance-order conjecture for the Fibonacci-word multiplicity matrix
Statement
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.
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.