July 13, 2012

Minipolymath4 project, second research thread

It’s been almost 24 hours since the mini-polymath4 project was opened in order to collaboratively solve Q3 from the 2012 IMO. In that time, the first part of the question was solved, but the second part remains open. In other words, it remains to show that for any sufficiently large and any , there is some such that the second player B in the liar’s guessing game cannot force a victory no matter how many questions he asks.

As the previous research thread is getting quite lengthy (and is mostly full of attacks on the first part of the problem, which is now solved), I am rolling over to a fresh thread (as is the standard practice with the polymath projects). Now would be a good time to summarise some of the observations from the previous thread which are still relevant here. For instance, here are some relevant statements made in previous comments:

Without loss of generality we may take N=n+1; if B can’t win this case, then he certainly can’t win for any larger value of N (since A could simply restrict his number x to a number up to n+1), and if B can win in this case (i.e. he can eliminate one of the n+1 possibilities) he can also perform elimination for any larger value of N by partitioning the possible answers into n+1 disjoint sets and running the N=n+1 strategy, and then one can iterate one’s way down to N=n+1.

In order to show that B cannot force a win, one needs to show that for any possible sequence of questions B asks in the N=n+1 case, it is possible to construct a set of responses by A in which none of the n+1 possibilities of x are eliminated, thus each x belongs to at least one of each block of k+1 consecutive sets that A’s answers would indicate.

It may be useful to look at small examples, e.g. can one show that B cannot win when k=1, n=1? Or when k=2, n=3?

It seems that some of the readers of this blog have already obtained a solution to this problem from other sources, or from working separately on the problem, so I would ask that they refrain from giving spoilers for this question until at least one solution has been arrived at collaboratively.

Also, participants are encouraged to edit the wiki as appropriate with new developments and ideas, and participate in the discussion thread for any meta-discussion about the polymath project.

Share this:

Like this:

Related

21 Comments

If k=1 n=1 then then A chooses N=2 x=1. To the question is x=1 or x=2 A answers yes unless the previous question was the same and he answered yes to it then he answers no. To the question is x in the set containing both 1 or 2 A answers yes. Then he never tells 2 lies in a row and never breaks symmetry between 1 or 2 so it will be impossible for B to figure out which A has chosen.

Just to rephrase the question, as it takes me a long time to figure out how B can extract information if A just acts randomly:

Suppose that B askes a series of questions, and A answers a sequence of Yes and No. We call A’s answers a “dubious” sequence, call it Ans, indexed by i.

For every element x in {1,2,…,N}, we can construct a “truthful” sequence, call it Truth(x), i being the index, where A always give the correct answer given that x is the secret number.

Now B can exclude the possibility of y being secret number, if Truth(y) and Ans differ in k+1 consecutive terms (*). Phrasing in this way, A’s lying strategy would be looking at the set of all truthful sequences given B’s question, and choose Yes or No to prevent scenario (*) from happening.

Comparing sequences Ans and Truth(y), we could define Lie(y)_ j := total number of consecutive lies by A so far, after answering j-th question, after last telling truth. If Ans_i = Truth(x)_i, Lie(x)_i clears to zero; otherwise, Lie(x) increments by 1. When Lie(y) reaches k+1, we know that y is not the secret number; and this is what A wants to avoid.

The trick here for B is to force the sequence Lie(x) for some x, to increase k+1 times consecutively, regardless of how A answer. At first, all Lie(x) are 0.

If B asks if “x is in S?”, A has two choices:

1. Say “Yes”. Then Lie(x) clears to zero for x in S, and Lie(x) increments by 1 for x not in S.
2. Say “No”. Then Lie(x) increments by 1 for x in S, and Lie(x) becomes 0 for x not in S.

In this way, we can think of the following games, similar to Conway’s checkers:

There are N checkers on horizontal line y=0. Each time, B can partition these checkers into two set, X and Y, then A can either move all the checkers in X vertically up by 1 and put all checkers in Y back to line y = 0, or move all the checkers in Y vertically up by 1 and all checkers in X back to the line y = 0. (Here Lie(x) is the vertical distance of checker x to the line y = 0.) Show that no checkers can reach line y = k+1.

For k = 2, n = 2 (which, like (k, n) = (1, 1), has k = 1/2 * 2^n)), one can proceed as follows (here N = 3; say the numbers are 1, 2, and 3):
I) Whatever B guesses on turn 1, A answers as if A’s number was ACTUALLY 1.
II) Whatever B guesses on turn 2, A answers as if A’s number was ACTUALLY 2.
III) Whatever B guesses on turn 3, A answers as if A’s number was ACTUALLY 3.

And so A goes on: pretending his number is actually 1 on turns congruent to 1 mod 3, 2 on turns that are 2 mod 3, and 3 that are 3 mod 3… no matter what A chooses, A’s statement is automatically true at least every third move..

Let , and let be a sequence of non-empty subsets of . Player A needs to find a cover of , with , consisting of member(s) of and their complement(s) with respect to .

If such a strategy exists for , it exists for all as well, since Player A could simply use the strategy.

If Player B asks followed by , and , then Player A can complete the cover by negating the answer for .

If the set of possible indicated over the past turns by Player A is and , then the cover can be completed by answering “No”. If the set of not-yet indicated over the past turns by Player A is and , then the cover can be completed by answering “Yes”.

Formulation 2

There are questions. Assign each question a unique, -digit binary string , where the -th digit of equals 1 if it is asked, and accumulate the indicated answers in a bit string . Player A can either bitwise or and , or bitwise or and . The goal is to have after turns.

, so an equivalent condition is . Therefore Player A must indicate half or more of the remaining digits with each question. This can be done by selecting either or , depending on whichever indicates more new bits. or its negation will indicate at least half of the remaining bits, since any and its negation indicate all of the bits. This can be done in at most operations: given , . For at least one of those operations, telling the truth will be the optimal choice. If it were not, Player B would have to ask unique questions such that was always in the smaller group of bits. This would mean that only was not indicated on question . However, would still be indicated in that answer. If , then a “yes” answer indicates , and if not, a “no” answer indicates as well.

An easy observation that probably a lot of people have made: A can win if k=n=1. A chooses either 1 or 2, at random, and then alternates answering between answering the question as if the correct answer were 1 and answering as if it were 2. There is no way for B to know which half of A’s answers are truthful. More generally, A can win whenever k=n.

What is the current fastest growing function f(k) so that A can win for n=f(k)?

Here is how I am currently thinking about the problem. I’m using the reduction where .

Let’s say that player A “suggests” whenever she gives an answer which is consistent with being the secret number.

For any $i$, if $A$ ever goes turns without suggesting , then $A$ loses. If was the secret number, then has broken the rules. If not, then can eliminate and win.

If there are ever numbers, say and , which have not been suggested for turns, then wins. This is because can ask a question which makes it impossible for to suggest both and , then win as in the previous paragraph.

Similarly, $A$ loses if there are ever numbers which have not been suggested in turns, or which have not been suggested in , etc.

Turning this logic around, in a winning strategy for , the number of digits which have NOT been suggested for the last rounds should grow exponentially in .

This hasn’t suggested a strategy to me yet, but my understanding is that the rules of a Polymath are that I should toss all my ideas out there.

Here is a template for a strategy for . At any moment in time, let be the number of values which have not been suggested for the last rounds. So the number of elements which just got suggested is , and we want to make sure that is always . Choose some positive real weights , , …, . always makes the choice (whether to lie or tell the truth) which minimizes . At the moment, I don’t have specific weights to nominate, but my intuition is that should grow just a little slower than .

For example, suppose that we take . Let the current score be B. Let be the part of the score which comes from numbers that would be suggested by answering YES and let be the part of the score which comes from numbers that would be suggested by answering NO. So . Let be the number of numbers contributing to , and likewise for . So , and both are positive.

Without loss of generality, say . So A answers YES, and the new score is.

So the score can never get above the fixed point of this recursion, at . So there will never be an element which goes unsuggested for steps where . So this is a winning strategy for .

I think I just solved the problem. I'm going to sit back and think about this for a bit.

You want to solve it for n greater than 1.99^k. That can be fixed by changing w_i to 1.999^i. If your method works I think you can change the exponent in your w_i and get an answer greater than any exponent less than 2for large enough k.

Here is an attempt to write up my solution neatly from scratch. My apologies if either (1) I have stolen people’s fun by getting to the answer too fast or (2) I have wasted people’s time with a faulty solution.

Let be a small parameter. Our strategy will allow Alice to deny Bob a certain win with . By first choosing sufficiently small (say ) and then sufficiently large, this is greater than .

With , Alice starts by choosing a random integer from to . Alice then never considers this value again. Since her answers will in no way depend what number she has chosen, they can reveal no information about that number, and therefore can provide Bob with no aid. What we must see is that Alice can do this while obeying the rule that she must tell the truth once every rounds.

We say that Alice “suggests ” if she gives an answer which would be truthful, if her number were . We will describe a strategy so that Alice suggests every number at least once every turns. In particular, she suggests the true number once every rounds, and thus obeys the rules.

Let be the number of values which have not been suggested in the last rounds. Alice’s strategy will be to always answer so as to minimize the quantity . We’ll call this quantity the score. At the beginning of the game, the score is . Suppose that the score is . The next question is asked about set . Let and . Let be the part of the score contributed by numbers in , and let be the part contributed by numbers not in . Then the new score is . Since , Alice can definitely arrange for the new score to be . So, inductively, the score never gets higher than . In particular, there is no contribution from such that . Since we chose such that , that means that we have succeeded in suggesting every value at least once every steps, as desired. QED

“Just the place for a Snark! I have said it twice: That alone should encourage the crew.
Just the place for a Snark! I have said it thrice: What I tell you three times is true.”

Is there anything wrong with the following proof that the bound of part 1 can be improved to
n>2^(k-1) +1?
Preamble
For a set U of 2^m possible integers, define strategy X for B as follows. First ask m “binary digit” questions. A will then have claimed x is in m subsets which exclude just 1 of the 2^m possible integers – call this integer X(U). B then asks if x is X(U).
Proof
Suppose n = 2^(k-1) +2.
As noted by others, A can be “forced” to say x is a particular element. Consider this to be the first question and answer.
Let U be 2^(k-1) of the integers, excluding the particular element and one other. Apply strategy X for questions 2 to k+1. (For questions 2 to k arbitrarily add just one of the two excluded elements to S.)
As before, A is “forced” to say x is X(U) in answer to question k+1. Now consider questions k and k+1 to be the first two questions. At this point, A has claimed that x is in a set containing 2^(k-2) + 1 integers and has claimed that x is X(U). Let V and W be two sets, each containing 2^(k-2) integers, but excluding X(U), such that V is part of the first claimed set and W is not.
Now, for questions 3 to k+1, apply strategy X to set W. Questions 3 to k can be used to similarly and simultaneously analyse set V. (For questions 3 to k arbitrarily add just one of the two elements not in V or W to S.)
As before, A is “forced” to say x is X(W) in answer to question k+1. Furthermore, if B asks if x is X(V) for question k+2, then A is “forced” to say yes.
Now, once again, consider questions k and k+1 to be the first two questions. Let Z be the 2^(k-1) integers excluding X(V) and X(W) and apply strategy X to Z. Before the final question is asked B knows that x is not X(Z).

For N = 2 if N = 2^k, thus sharpening the assertion of the IMO problem to n >= 2^k – 1 for k >= 2. For k = 2 it seems to be similar to Jerzy Wojciechowski’s in #10. Combining this with William Meyerson’s #3 we thus know that n = 2^k – 1 = 3 is the minimum for k = 2. From other posts we have n = 1 for k = 0 and n = 2 for k = 1. The question of the minimum for arbitrary k appears to be still open.

The interface apparently does’nt like “less than” and “larger than” signs and so skipped a large part of my post. Since I see no way of editing or withdrawing posts, I thus have to submit it once more. Please neglect that above:

For N less than 2^k, binary digit questions don’t necessarily enforce a yes. The x that is excluded may be larger than N. In that case B learns nothing from asking if it is the true x. Thus the “particular element” of Stan Dolan’s argument may not exist.

The argument seems to work for k not less than 2 if N = 2^k, thus sharpening the assertion of the IMO problem to n not less than 2^k – 1 for k not less than 2. For k = 2 it seems to be similar to Jerzy Wojciechowski’s in #10. Combining this with William Meyerson’s #3 we then know that n = 2^k – 1 = 3 is the minimum for k = 2. From other posts we have n = 1 for k = 0 and n = 2 for k = 1. The question of the minimum for arbitrary k appears to be still open.

Let’s look at the case when k=2 and n=3. It seems to me that B can win. Let N=4. Let B ask the first question with S={1,2} and the second with S={1,3}. Then there is exactly one number m in {1,2,3,4} so that when x=m the first two answers of A are false. Then B asks the third question with S={m}, A must answer yes, since otherwise m could be eliminated. Let w be such that the second question was false when x=m or when x=w. Let B ask the fourth question with S={w}. Again A must answer yes, since otherwise w could be eliminated. If {1,2,3,4}-{m,w}={y,z} then let B ask the fifth question with S={z}. If A answers yes, then y can be eliminated, if A answers no, then z can be eliminated.

The idea still uses the fact that within k questions, we can get player 1 to lie about one of the numbers k times (for instance, the strategy of asking about what the i-th bit is does that trick), and then… how to uses subsequent questions to force player 1 into fewer and fewer options for answer choices.

In short, for this strategy, player 2 follows the de Brujin sequence for bitstrings of length k (B(2,k)) to figure out when he should include a particular number i in the question. For the i-th number, start from the i-th element of the de Brujin sequence, if we see a 1, include it in the set for the question. What this does is that for every contiguous block of questions, and no matter what player 1 answers, he will lie about a particular number $k$ times, and this number rotates. In effect, if we examine all possible strategies for player 1 for this set of questions, the player must follow 1 of 2^k possible sequences.

Then, use the last number (2^k+1) as a trap: throw in this number and follow a particular possible answer sequence for k questions. On the k+1-th question, place the last number to oppose that answer sequence, then player 1 is trapped if he followed that answer sequence. Set these traps one bunch at a time, until all of them are gone. It takes a lot longer than the short answer proposed already, but it seems fun. Should have occurred to me to set the trap up at the beginning. Oh well…

I realize that this polymath project has ended about a month ago. I’m writing this comment only for “future reference” if someone is interested in this IMO problem and wants to figure out a better estimate (asymtotics) for the smallest n (as a function of k) that makes the game a win for B.

First I state an equivalent formulation of the problem in terms of existence of certain binary trees. This provides another way to look at the problem and has the advantage that this problem has been studied in relation to unsatisfiable CNF Boolean formulas and the complexity of certain restrictions of SAT, so I can quote results (including one that is partially mine – sorry).

A finite rooted binary tree is called a (k, d)-tree if
(i) every non-leaf vertex has exactly two children,
(ii) each leaf has distance at least k from the root, and
(iii) every node u of the tree has at most d leaves that are both descendants of u and in distance at most k from u.

We call leaves satisfying (iii) with respect to a vertex u “visible from u”. We call them left- or right-visible depending on whether they are descendants of the left or right child of u (the two children of u are distinguished arbitrarily).

CLAIM: The liar’s guessing game for k and n is a win for B if and only if there exists a (k+1,n+1)-tree.

PROOF: Let’s assume first that B wins and fix a winning strategy for N=n+1. We assume he stops asking questions as soon as he can eliminate one of the n+1 possibilities for the unknown x, that is when A’s last k+1 answers are all false for some possible choice for x. Let us build the game tree from B’s strategy: the root corresponds to the initial position before the first question was answered, its two children correspond to the two possible answers, etc. Leaves correspond to the end of the game when the last k+1 answers eliminate a possible value for x. Let us label each leaf with one of the eliminated values.

For the “only if” part we prove that this is a (k+1,n+1)-tree. Parts (i) and (ii) of the definition are satisfied trivially. Part (iii) follows from the observation that all leaves visible from a vertex u of the tree must have different labels. Indeed, otherwise there would be a vertex u’ of the tree with a left-visible and a right-visible leaf having the same label x. But this would mean that both answers to the question B asks at the position u’ rules out x – a contradiction.

For the reverse direction (the “if” part) we use the observation that B wins if and only if he wins with N=n+1. Assume there is a (k+1,n+1)-tree. Label the leaves with values 1<=x<=n+1 such that all leaves visible from the same vertex have distinct labels. This is possible, one can label the leaves in increasing order of their level (distance from the root). Condition (iii) makes sure we have always enough labels to choose from. Now here is a strategy for B to eliminate one of the n+1 possible values for x: Start at the root. At a vertex u ask if there is a leaf labeled x left-visible from u. If the answer is YES move to right child, for NO answer move to the left child. When B arrives to a leaf it can rule out its label and hence wins the game.

QED

And now the references: Let f(k) denote the largest d with no (k,d)-tree (referred to as f_2 in [GST]). Then f(k)=\Theta(2^k/k) by [G] and f(k)=(2/e+O(k^{-1/2}))2^k/k by [GST]. The lower bound can easily be derived from Lovasz's local lemma, the upper bound is based on an elaborate construction. Because of the shift by 1 this means that the smallest n such that B wins the liar's guessing game for k and n is (4/e+O(k^{-1/2}))2^k/k.