The generalized eigenspace-dimension conjecture for uniform qualitative independence graphs

From papers

Let UQI(ck,k)UQI(ck,k) be the uniform qualitative independence graph on uniform kk-partitions of a ckck-set, and consider the eigenspace corresponding to its smallest eigenvalue.

Generalized eigenspace-dimension conjecture. For all positive integers c,kc,k, this eigenspace has dimension

(ck2)(ck1).\binom{ck}{2}-\binom{ck}{1}.

The paper reports that the formula holds for the examples QI(3c,3)QI(3c,3) with c=3,4,5,6c=3,4,5,6, and suggests extending the earlier conjecture from QI(k2,k)QI(k^2,k) to all UQI(ck,k)UQI(ck,k).

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

No solutions have been posted yet.