Consider the following game on n bits among three players, Alice, Bob and Carol. The game works as follows: Carol picks a bit position and Alice sets that bit to 0 or 1. Carol then picks another unused bit position and Alice sets that bit as well. This repeats until the last bit which Carol gets to set herself. The bits are then revealed to Bob who has to give a set of bit positions that includes the bit Carol set at the end. Alice and Bob can work out a strategy ahead of time with the goal of minimizing the size of the set.

If Carol can force Bob to give a set of n

^{ε}bits for some ε>0, this would prove the sensitivity conjecture! Basically a family of functions that give a counterexample to the sensitivity conjecture would give a strategy for Alice and Bob that yields a set of size n

^{o(1)}. You can find the full proof in the papers above.

How well can Alice and Bob do? They can use the following strategy to achieve n

^{1/2}: Break up the input positions into n

^{1/2}groups of n

^{1/2}bits each. Whenever Carol picks a bit position, Alice sets that bit to zero unless it is the last bit in that group in which case she sets it to one. Carol can set the last bit in some group anyway she wants. Bob will either see every group having one 1 and will give the set of the positions of all the 1's, or Bob will see a group of all zeros and give the positions in that

group.

Mario Szegedy uses error-correcting codes to improve the upper bound to O(n

^{0.4732}). A Georgia Tech undergraduate DeVon Ingram improves the upper bound to O(n

^{0.4696}) by generalizing Szegedy's techniques. Ingram's proof comes down to finding a one-to-one function mapping subsets of {1,...,15} of size 4 to perfect codes of length 15 with the property that the bits of the code are 1 for the indices of the subset. Perhaps one could find a clever mapping that has this property but Ingram wrote code using a matching algorithm. A true computer assisted proof. Longer code lengths alas won't yield direct improvements.

The connection to sensitivity doesn't go both ways. An upper bound of n

^{o(1) }wouldn't necessarily yield a counterexample to the sensitivity conjecture though would tell us the limitation of this game approach. Nevertheless I find it cool that a game that doesn't talk about functions at all could help settle an important question about them.

The game seems equivalent to the last riddle in here: https://www.brand.site.co.il/riddles/201710q.html .

ReplyDeleteA better upper bound O(n^.334) is given by Uoti Urpala in the solution.

yo is this dingram from the pokemons doing all this?

ReplyDeleteplease stop him from crossing over to the dark side! he is getting way into all this elliptic cohomology business, and i am very concerned for him

I think something is missing from the game description. What conditions must Bob's set satisfy besides containing Carol's last bit?

ReplyDeleteThat the only condition, though the goal is to make that set as small as possible.

DeleteI must be missing something. Isn't the smallest set meeting that condition just the singleton whose only element is the required bit?

ReplyDeleteNever mind, I now understand that Bob doesn't know who set which bit.

ReplyDelete