Timeline for adjacency matrix of a graph and lines on quartic surfaces
Current License: CC BY-SA 3.0
9 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| S Mar 27, 2016 at 9:14 | history | suggested | Davide Cesare Veniani | CC BY-SA 3.0 |
added link to submitted paper
|
| Mar 27, 2016 at 9:08 | vote | accept | Davide Cesare Veniani | ||
| Mar 27, 2016 at 9:07 | review | Suggested edits | |||
| S Mar 27, 2016 at 9:14 | |||||
| May 15, 2014 at 4:05 | comment | added | Alex Degtyarev | Oops. Sorry, actually, that's the one I meant. As to Segre, let me double check. | |
| May 14, 2014 at 21:07 | comment | added | Davide Cesare Veniani | @AlexDegtyarev I couldn't track down your bound of 48 lines in neither of the articles mentioned. Segre treats this case at the end of his article, giving a bound of 64. Rams and Schütt in arXiv:1212.3511 give a similar proof in Lemma 5.5, producing a bound of 62. | |
| May 14, 2014 at 20:57 | comment | added | Davide Cesare Veniani | I guess it is worth mentioning this article, again by Rams and Schütt, where the proof on the bound of 64 lines can be found arXiv:1212.3511. This is actually the article that inspired my question. | |
| May 14, 2014 at 14:18 | comment | added | Alex Degtyarev | I said we are about to submit a paper. The paper I referred to uses the classical approach and bridges the gap in Segre's proof. | |
| May 14, 2014 at 9:36 | comment | added | Felix Goldberg | Your paper does not seem to mention hyperbolic graphs. Is there some other place where the connection is written up? | |
| May 13, 2014 at 12:44 | history | answered | Alex Degtyarev | CC BY-SA 3.0 |