Timeline for Finding an adjacency matrix whose cube's diagonal is equal to a given vector
Current License: CC BY-SA 3.0
22 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Apr 18, 2019 at 20:03 | history | bumped | CommunityBot | This question has answers that may be good or bad; the system has marked it active so that they can be reviewed. | |
| Dec 19, 2018 at 19:03 | history | bumped | CommunityBot | This question has answers that may be good or bad; the system has marked it active so that they can be reviewed. | |
| Nov 19, 2018 at 19:01 | history | bumped | CommunityBot | This question has answers that may be good or bad; the system has marked it active so that they can be reviewed. | |
| Oct 20, 2018 at 19:00 | history | bumped | CommunityBot | This question has answers that may be good or bad; the system has marked it active so that they can be reviewed. | |
| Sep 20, 2018 at 19:00 | history | bumped | CommunityBot | This question has answers that may be good or bad; the system has marked it active so that they can be reviewed. | |
| Aug 21, 2018 at 18:02 | history | bumped | CommunityBot | This question has answers that may be good or bad; the system has marked it active so that they can be reviewed. | |
| Jul 22, 2018 at 17:08 | history | bumped | CommunityBot | This question has answers that may be good or bad; the system has marked it active so that they can be reviewed. | |
| Jun 22, 2018 at 16:14 | history | bumped | CommunityBot | This question has answers that may be good or bad; the system has marked it active so that they can be reviewed. | |
| May 23, 2018 at 15:51 | history | bumped | CommunityBot | This question has answers that may be good or bad; the system has marked it active so that they can be reviewed. | |
| S Apr 23, 2018 at 14:59 | history | suggested | Rodrigo de Azevedo | CC BY-SA 3.0 |
Minor edits
|
| Apr 23, 2018 at 14:58 | review | Suggested edits | |||
| S Apr 23, 2018 at 14:59 | |||||
| Apr 23, 2018 at 14:40 | comment | added | Student88 | Thank you @RodrigodeAzevedo, I've edited the question, I think it's much harder now though. | |
| Apr 23, 2018 at 14:39 | history | edited | Student88 | CC BY-SA 3.0 |
I've revised the question to describe my constraints more accuratly
|
| Apr 23, 2018 at 14:32 | comment | added | Rodrigo de Azevedo | That means there are only $n$ constraints, rather than $n^2$. I believe you should edit your question. | |
| Apr 23, 2018 at 14:26 | comment | added | Student88 | Yes, you are right, $B$ can be nonnegative. And Yes, only the diagonal of $A^3$ (which stands for the number of triangles that each vertex participates in) | |
| Apr 22, 2018 at 10:05 | comment | added | Rodrigo de Azevedo | Why must $B$ be positive rather than nonnegative? Do you only care about the diagonal of $A^3$? | |
| Apr 22, 2018 at 9:54 | comment | added | Student88 | Hi Rodrigo, This problem actually stems from its graph interpretation as suggested below. I'm trying to characterize all the graphs (with a given number of vertices) that share the same triangle-distribution over the edges, i.e. that share the same diagonal of A^3 where A is the adjacency matrix. | |
| Apr 18, 2018 at 16:17 | comment | added | Rodrigo de Azevedo | Where does this problem come from? What is the motivation? | |
| S Apr 18, 2018 at 13:57 | history | suggested | Rodrigo de Azevedo | CC BY-SA 3.0 |
Minor edits
|
| Apr 18, 2018 at 13:01 | review | Suggested edits | |||
| S Apr 18, 2018 at 13:57 | |||||
| Apr 18, 2018 at 7:52 | answer | added | Gregg | timeline score: -2 | |
| Apr 18, 2018 at 4:32 | history | asked | Student88 | CC BY-SA 3.0 |