Skip to main content

Timeline for Inertia of a class of Cayley graphs

Current License: CC BY-SA 3.0

10 events
when toggle format what by license comment
Mar 20, 2018 at 18:07 comment added Dima Pasechnik for $n=2d$ there are (conjecturally) $2^d$ more (or less, depending upon the parity of $d$ mod 4) positive than negative eigenvalues, see my answer.
Mar 20, 2018 at 17:23 comment added Dima Pasechnik see my edited answer for a conjecture for this case; it's kind of pretty :-)
Mar 20, 2018 at 9:00 comment added Clive elphick I do mean "at least" and I am specifically interested when d = n/2. I am building on the paper "On the orthogonal rank of Cayley graphs and impossibility of quantum round elimination" by Briet and Zuiddam.
Mar 19, 2018 at 19:02 comment added David G. Stork Do you mean "at least $d$" or "at most $d$"?
Mar 19, 2018 at 14:15 history edited YCor
edited tags
Mar 18, 2018 at 23:07 comment added Dima Pasechnik yes, indeed, this is very much related - different graph built from the same Hamming association scheme H(n,2)
Mar 18, 2018 at 12:15 comment added Peter Heinig To add context, the following is related: mathoverflow.net/questions/294675/…
Mar 18, 2018 at 12:14 history edited Peter Heinig CC BY-SA 3.0
Latex-formattting improved, orthography in title, relevant tags added.
Mar 18, 2018 at 10:51 answer added Dima Pasechnik timeline score: 5
Mar 18, 2018 at 9:39 history asked Clive elphick CC BY-SA 3.0