22 Replies to “Round We Go”

  1. It looks like some sort of depiction of a group or algebraic structure. I guess that’s the obvious part (or not, who knows). I can’t see all the connections. At first glance it looks like it is a set of subsets closed under unions and symmetric differences. Not sure about the red stuff though.

  2. John you are stereotyping me 🙂 Nope not related to the toric code.
    I’m surprised no one has spotted the pattern in the graph. I’m not as surprised that no one knows what it is…the only people I know who might know that answer are CS theorists.

  3. Ohh, not dynamical. Rotating is just for giggles, or to show us all the edges. This is part of the conformal graphs thing?

  4. The edges from the (a,b) boxes are hard to see [white background and thicker lines might be better for display?]
    I’m trying to discern why you are interested in combinations of two things chosen from four? Is the four item node in the graph adjacent to any of the (a,b) boxes?

  5. Well how about a full description of the adjacencies? After all, if the video was high enough quality and we had good enough eyes, that data would be available to us.

  6. [0,1,2,3] – a1,a2,a3,a0
    [0,1] – a0,b2,a1,b3
    [0,2] – b1,a2,b3,a0
    [0,3] – b2,b1,a0,a3
    [1,2] – b0,a1,b3,a2
    [1,3] – a1,b0,b2,a3
    [2,3] – a2,a3,b0,b1
    [] – b1,b3,b2,b0

  7. Uhmm, if there’s a number x in [], then there’s a connection to ax, if not, it’s connected to bx, e.g. empty [] is connected to all b’s, [0,1,2,3] is connected to all a’s. I guess that’s not enough to be of interest to a CS theorist (?)

Leave a Reply

Your email address will not be published. Required fields are marked *