The generalized eigenspace-dimension conjecture for uniform qualitative independence graphs
The generalized eigenspace-dimension conjecture for uniform qualitative independence graphs
Let be the uniform qualitative independence graph on uniform -partitions of a -set, and consider the eigenspace corresponding to its smallest eigenvalue.
Generalized eigenspace-dimension conjecture. For all positive integers , this eigenspace has dimension
The paper reports that the formula holds for the examples with , and suggests extending the earlier conjecture from to all .
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Sources & referencesView supporting material
Primary source
Karen Meagher, “Covering arrays on graphs: qualitative independence graphs and extremal set partition theory”, arXiv:math/0701553 (2007).
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.