On the degree of symmetric functions on the Boolean cube Joint work with Amir Shpilka

The basic question of complexity

How complex is it (how hard it is to compute f?)

The basic question of complexity How complex is it (how hard it is to compute f?) That depends on the computational model at hand. e.g. Turing machines, Circuits, Decision trees, etc…

Polynomials as computers How complex is it (how hard it is to compute f?) That depends on the computational model at hand. e.g. Turing machines, Circuits, Decision trees, etc… Our model of computation – Polynomials.

Polynomials as computers Our model of computation – Polynomials.

Polynomials as computers Our model of computation – Polynomials.

Tight lower bound Nisan and Szegedy (94) proved assuming f depend on all n variables.

Tight lower bound Nisan and Szegedy (94) proved assuming f depend on all n variables. Can we get stronger lower bounds on more restricted natural classes of functions?

Symmetric Boolean functions

Von zur Gathen and Roche (97) proved assuming f is non-constant.

Symmetric Boolean functions

n c

Symmetric Boolean functions n c

Symmetric Boolean functions What can be said about ? n c

Symmetric functions What can be said about ? For c=1 we got For c=n the function has degree 1.

Symmetric functions What can be said about ? For c=1 we got For c=n the function has degree 1. How does the degree behaves?

Symmetric functions Von zur Gathen and Roche noted that

Symmetric functions Von zur Gathen and Roche noted that In particular, even for this observation doesn’t exclude the existence of a parabola interpolating on some function.

Relative degree Define

Relative degree Define is monotone decreasing in c.

Relative degree Define is monotone decreasing in c. has a crazy behavior in n.

Relative degree Define is monotone decreasing in c. has a crazy behavior in n.

6 stages of first-time research Stage 1

6 stages of first-time research Stage 2

6 stages of first-time research Stage 3

6 stages of first-time research Stage 4

6 stages of first-time research Stage 5

6 stages of first-time research Stage 6

6 stages of first-time research Stage 1…

Our main result Main theorem This proves a threshold behavior at c=n.

Main theorem This proves a threshold behavior at c=n. Yet another theorem Our main result

Proof strategy – reducing c Lemma 1. For any n there exist a prime p such that and

Proof strategy – reducing c Lemma 1. For any n there exist a prime p such that and Together with the trivial bound, we already get a threshold behavior

Proof strategy – reducing n Lemma 2. For every c,m,n such that, it holds that Dream version

Proof strategy – reducing n Lemma 2. For every c,m,n such that, it holds that Dream version

Proof strategy – reducing n Lemma 2. For every c,m,n such that, it holds that Dream version

Proof strategy – reducing n Lemma 2. For every c,m,n such that, it holds that

Proof of the main theorem A computer search found that. By Lemma 2 By Lemma 1

Periodicity and degree Low degree Strong periodical structure Dream version

Periodicity and degree Low degree Strong periodical structure Strong periodical structure High degree Dream version

Periodicity and degree Low degree Strong periodical structure Strong periodical structure High degree Hence no function has “to low” degree. Dream version

Periodicity and degree Low degree Strong periodical structure Strong periodical structure High degree Not the same sense of periodical structure…

Low degree implies strong periodical structure Lemma 3. Let with. Let be a prime number. Then for all such that it holds that d... p 0 1. c n

Low degree implies strong periodical structure Lemma 3. Let with. Let be a prime number. Then for all such that it holds that d... p q 0 1. c n

Low degree implies strong periodical structure Lemma 3. Let with. Let be a prime number. Then for all such that it holds that d... p q r 0 1. c n

Strong periodical structure implies high degree Definition. Let and define

Strong periodical structure implies high degree Definition. Let and define

Lemma 4. Let. Then for all If then If then or Strong periodical structure implies high degree Definition. Let and define

Proof of Lemma 1 Lemma 1. For any n there exist a prime p such that and

Proof of Lemma n n-1

Proof of Lemma p... 2p n n-1 o(n)

Proof of Lemma p... 2p n n-1 o(n)

Proof of Lemma p... 2p n n-1 o(n) We might as well assume that non-constant

Proof of Lemma p... 2p n n-1 o(n) We might as well assume that non-constant

Proof of Lemma 1 Define

Proof of Lemma 1 Define From Lemma 3

Proof of Lemma 1 Define From Lemma 3 and also

Proof of Lemma 1 From Lemma 3 Hence

Proof of Lemma 1 Case 1: g is a non-constant and we are done.

Proof of Lemma 1 Case 2: g is a constant G Hence, by Lemma 4

Proof of Lemma 1 Case 2: g is a constant G Hence, by Lemma 4 or is linear.

Proof of Lemma 1 Case 2: If happens to be linear, apply the proof so far on. Since we are done unless it also happens that is linear. But this means f itself must be linear. Since f is not constant it means f assumes n+1 distinct values – a contradiction.

Open Questions Main question - Better understand. Improve the lower bounds to non-linear, if possible.

Thank you!