the group has generated routes called Hamiltonian cycles
i only know this term which is simply a cycle going through all nodes, so Im going to assume there is a much easier way to explain what they achieved but the journalists are trying to be obtuse in order to sound smart.
Ha ha, maybe. The article is pretty short. However, the actual paper linked at the bottom of the article is titled “Hamiltonian cycles on Ammann-Beenker Tilings” (unfortunately I can only see the abstract), so the original authors are also responsible!
It’s my thinking that the key point of thr Hamiltonian cycle in this context is it visits nodes only once thereby creating a unique path. The trick here seems to be then joining those paths for a collection of subgraphs? I’m really not sure. It’s a bit beyond me, but I find it interesting to think about.
i only know this term which is simply a cycle going through all nodes, so Im going to assume there is a much easier way to explain what they achieved but the journalists are trying to be obtuse in order to sound smart.
Ha ha, maybe. The article is pretty short. However, the actual paper linked at the bottom of the article is titled “Hamiltonian cycles on Ammann-Beenker Tilings” (unfortunately I can only see the abstract), so the original authors are also responsible!
It’s my thinking that the key point of thr Hamiltonian cycle in this context is it visits nodes only once thereby creating a unique path. The trick here seems to be then joining those paths for a collection of subgraphs? I’m really not sure. It’s a bit beyond me, but I find it interesting to think about.
Its fine for a scientific paper, expected even, but this is meant to be an article for the non-experts.
ooh I do love me some graph theory so I am going to look more into this thanks!
deleted by creator