A coefficient pattern conjecture for the characteristic polynomial of the substitution matrix

Let nn be odd with n5n\geq 5, let MnM_n be the substitution matrix, and write its characteristic polynomial as

pn(x)=(x1)qn(x).p_n(x)=-(x-1)q_n(x).

The coefficients of qn(x)q_n(x) in standard form are arranged according to the pattern described in the paper: their signs from left to right are +,,,+,+,,,+,+,+,-,-,+,+,-,-,+,+,\ldots, the last two coefficients in each row are 11 or 1-1 depending on nn, and each remaining coefficient is obtained by summing the absolute values of the two numbers indicated by adjacent segments of the same color and assigning the sign determined by its position. Coefficient-pattern conjecture. This coefficient pattern holds for all odd n5n\geq 5.

Sources & referencesView supporting material

Primary source

April Lynne D. Say-awen, “Tilings with Infinite Local Complexity and n-Fold Rotational Symmetry, n=13,17,21”, arXiv:2408.17082 (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.