MHB Is Two-Colour Bead Necklace Arrangement Possible?

  • Thread starter Thread starter evinda
  • Start date Start date
  • Tags Tags
    Bead
evinda
Gold Member
MHB
Messages
3,741
Reaction score
0
Hello! (Wave)

We have a necklace with $64$ beads from $8$ different colours. Is it possible that they are put in such a way that if we go along the necklace in one direction (in any of the two) then we see all the possible successions of two colours exactly once?
 
Physics news on Phys.org
evinda said:
Hello! (Wave)

We have a necklace with $64$ beads from $8$ different colours. Is it possible that they are put in such a way that if we go along the necklace in one direction (in any of the two) then we see all the possible successions of two colours exactly once?
This is called a De Bruijn sequence. (I'm assuming that the necklace is joined up at the ends so as to form a cyclic sequence of beads.)

The sequence that you want is the De Bruijn sequence $B(8,2)$. If you want to see an example, here it is (with the colours labelled $0$ to $7$).

[sp]http://www.hakank.org/comb/debruijn.cgi?k=8&n=2&submit=Ok[/sp]
 
Opalg said:
This is called a De Bruijn sequence. (I'm assuming that the necklace is joined up at the ends so as to form a cyclic sequence of beads.)

The sequence that you want is the De Bruijn sequence $B(8,2)$. If you want to see an example, here it is (with the colours labelled $0$ to $7$).

[sp]http://www.hakank.org/comb/debruijn.cgi?k=8&n=2&submit=Ok[/sp]

And how could we prove that such a sequence exists? (Thinking)
 
evinda said:
And how could we prove that such a sequence exists? (Thinking)
The construction of $B(2, 4)$ is illustrated in the wiki article. That should explain how to construct such sequences. You can see the proof of the general statement in West's Introduction to Graph Theory. Look for "De-Bruijn Cycles" in the index.
 
Hi all, I've been a roulette player for more than 10 years (although I took time off here and there) and it's only now that I'm trying to understand the physics of the game. Basically my strategy in roulette is to divide the wheel roughly into two halves (let's call them A and B). My theory is that in roulette there will invariably be variance. In other words, if A comes up 5 times in a row, B will be due to come up soon. However I have been proven wrong many times, and I have seen some...
Thread 'Detail of Diagonalization Lemma'
The following is more or less taken from page 6 of C. Smorynski's "Self-Reference and Modal Logic". (Springer, 1985) (I couldn't get raised brackets to indicate codification (Gödel numbering), so I use a box. The overline is assigning a name. The detail I would like clarification on is in the second step in the last line, where we have an m-overlined, and we substitute the expression for m. Are we saying that the name of a coded term is the same as the coded term? Thanks in advance.

Similar threads

Back
Top