Conjecture on strong nodal domains of ternary Hamming graphs
Statement
Let be the Hamming graph with vertex set , where two vertices are adjacent when they differ in exactly one coordinate. Its Laplacian has eigenvalue corresponding to the index . For an eigenfunction , let denote its number of strong nodal domains.
Conjecture on ternary strong nodal domains. For any eigenfunction of , , with eigenvalue we have .
This is the last remaining open case for the analogous problem with in the paper. Numerical experiments for found minimum values , respectively, supporting the conjectured linear lower bound.
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.