Anil Ada
email: aada@cs.cmu.edu

Omar Fawzi
email: omar.fawzi@ens-lyon.fr.

Raghav Kulkarni

On the Spectral Properties of Symmetric Functions

We characterize the approximate monomial complexity, sign monomial complexity, and the approximate L 1 norm of symmetric functions in terms of simple combinatorial measures of the functions. Our characterization of the approximate L 1 norm solves the main conjecture in [AFH12]. As an application of the characterization of the sign monomial complexity, we prove a conjecture in [ZS09] and provide a characterization for the unbounded-error communication complexity of symmetric-xor functions.

Introduction

Understanding the structure and complexity of Boolean functions f : {0, 1} n → {0, 1} is a main goal in computational complexity theory. Fourier analysis of Boolean functions provide many useful tools in this study. Natural Fourier analytic properties of a Boolean function can be linked to the computational complexity of the function in various settings like circuit complexity, communication complexity, decision tree complexity, learning theory, etc.

In this paper, our focus is on trying to understand the Fourier analytic (i.e. spectral) properties of symmetric functions, which are Boolean functions such that permuting the input bits does not change the output. Many basic and fundamental functions like and, or, majority, mod m are symmetric, and having a full understanding of the spectral properties of symmetric functions is a natural goal. Some of the important spectral properties of Boolean functions are the degree (the largest degree of a monomial with non-zero Fourier coefficient), the monomial complexity (the number of non-zero Fourier coefficients), and the Fourier L p norms. Often, the degree or the monomial complexity of a Boolean function does not give us useful information, so we study approximate versions like ǫ-approximate degree (the minimum degree of a polynomial that point-wise approximates the function) and sign degree (the minimum degree of a polynomial that sign represents the function). These measures have found numerous applications in computational complexity theory. Some earlier results on the spectral properties of symmetric functions include the characterization of sign degree [START_REF] James Aspnes | The expressive power of voting polynomials[END_REF], approximate degree [START_REF] Paturi | On the degree of polynomials that approximate symmetric Boolean functions (preliminary version)[END_REF], and Fourier L 1 norm [START_REF] Ada | Spectral norm of symmetric functions[END_REF].

Our main results are as follows.

• Theorem 3.1: characterization of approximate monomial complexity of symmetric functions.

• Theorem 3.2: characterization of sign monomial complexity of symmetric functions.

• Corollary 3.3: a lower bound on the L ∞ norm of symmetric functions.

• Theorem 3.4: characterization of approximate L 1 norm of symmetric functions. This solves the main conjecture of [START_REF] Ada | Spectral norm of symmetric functions[END_REF].

Our results have the following applications in communication complexity.

• Theorem 4.1: characterization of the unbounded-error communication complexity of symmetric-xor functions. This resolves a conjecture of [START_REF] Zhang | Communication complexities of symmetric xor functions[END_REF]. This result was obtained independently by Hatami and Qiang [START_REF] Hatami | The unbounded-error communication complexity of symmetric xor functions[END_REF].

• Theorem 4.3: verifying the log approximation rank conjecture for symmetric-xor functions.

To prove these results, we make use of (i) the close connections between Boolean functions and their corresponding two-party xor functions (Proposition 2.7), and (ii) the known bounds on the approximate rank and the sign rank of two-party symmetric-and functions (Theorem 2.5 and Theorem 2.6). We transform these results on two-party symmetric-and functions to the setting of symmetric xor-functions via reductions.

Preliminaries

General notation

We use [n] to denote the set {1, 2, . . . , n}. All the logarithms are base 2. For x ∈ {0, 1} n , |x| denotes the Hamming weight of x, i.e., |x| = i x i . For b ∈ {0, 1}, ¬b denotes negation of b. Given x and y in {0, 1} n , x ∧ y denotes the n-bit string obtained by taking the coordinate-wise and of x and y. Similarly, x ⊕ y denotes the n-bit string obtained by taking the coordinate-wise xor of x and y.

A Boolean function f : {0, 1} n → {0, 1} is called symmetric if the function's output does not change when we permute the input variables. When f is symmetric, we'll use f to also denote the corresponding function f : {0, 1, . . . , n} → {0, 1} with the understanding that f (|x|) = f (x). We define r 0 (f ) and r 1 (f )

r 0 (f ) def = min{r ≤ ⌈n/2⌉ : f (i) = f (i + 2) for all i ∈ [r, ⌈n/2⌉ -1]} r 1 (f ) def = min{r ≤ ⌊n/2⌋ -1 : f (i) = f (i + 2) for all i ∈ [⌈n/2⌉ , n -r -2]} Note that we have f (i) = f (i + 2) for all i ∈ [r 0 (f ), n -r 1 (f ) -2]. Then r(f ) = max{r 0 (f ), r 1 (f )}. Also, we let λ(f ) def = |{i : f (i) = f (i + 1)}|, and ρ(f ) def = |{i : f (i) = f (i + 2)}|.
When the function is clear from the context, we may drop the f from this notation.

Fourier analysis

Let f : {0, 1} n → {0, 1} be a Boolean function. We view f as residing in the 2 ndimensional vector space of real-valued functions {φ : {0, 1} n → Ê}. We equip this vector space with the inner product φ, φ

′ def = E [φ(x)φ ′ (x)]
, where x is uniformly distributed over {0, 1} n . For each S ⊆ [n], define the function

χ S (x) def = (-1) i∈S x i .
We refer to these functions as characters or monomials. It is easy to check that the set {χ S : S ⊆ [n]} forms an orthonormal basis. Therefore every function φ (including every Boolean function) can be written as S⊆[n] φ(S)χ S , where φ(S) = φ, χ S are the real-valued coefficients, called the Fourier coefficients. This way of expanding φ is called the Fourier expansion of φ.

The degree of a function φ is defined as deg(φ) def = max{|S| : φ(S) = 0} and the monomial complexity is defined as mon(φ) def = |{S : φ(S) = 0}|. We also define the Fourier p-norm:

φ p def = S | φ(S)| p 1/p . The Fourier infinity norm is defined to be φ ∞ = max S | φ(S)|.
For symmetric functions, [AFH12] characterized the Fourier 1-norm in terms of r(f ).

Theorem 2.1 ([AFH12]). Let f : {0, 1} n → {0, 1} be a symmetric function. When r(f ) > 1, we have log f 1 = Θ r(f ) log n r(f ) .

Matrix analysis

Let M ∈ Ê k×k be a real-valued matrix, with singular values σ 1 , σ 2 , . . . , σ k ≥ 0. The rank of M, denoted rank(M), is the number of non-zero singular values. The Schatten p-norm is defined as follows:

M p def = k i=1 σ p i 1/p , M ∞ def = σ 1 .
We then define trace norm:

M tr def = M 1 Frobenius norm: M Fr def = M 2 spectral norm: M def = M ∞
Given two matrices M and M ′ , we write M = M ′ if one can be obtained from the other after reordering the rows and/or the columns.

Approximation theory

Throughout the paper, ǫ denotes any constant in [0, 1/2). Given f : {0, 1} n → {0, 1}, we say that φ : {0,

1} n → R ǫ-approximates f if for all x ∈ {0, 1} n , |φ(x) -f (x)| ≤ ǫ.
Then the ǫ-approximate monomial complexity of f , denoted by mon ǫ (f ), is defined as the minimum monomial complexity of a function that ǫ-approximates f . Similarly we define f 1,ǫ . For a matrix M, rank ǫ (M) and M tr,ǫ are defined as the minimum rank and the minimum trace norm respectively, of a matrix that ǫ-approximates M entry-wise.

Given f : {0, 1} n → {0, 1}, we say that φ : {0, 1} n → R sign-represents f if for all x such that f (x) = 1, φ(x) > 0, and for all x such that f (x) = 0, φ(x) < 0. The sign monomial complexity of f , denoted mon ± (f ), is defined to be the minimum monomial complexity of a function φ that sign represents f . For a matrix M with entries in {0, 1}, we similarly define rank ± (M).

The following proposition provides a relationship between the approximate trace norm and the approximate rank:

Proposition 2.2 (Folklore). Let M ∈ {0, 1} k×k . Then, rank ǫ (M) ≥ M tr,ǫ k(1 + ǫ) 2 .
Proof. Let M ′ be a matrix that entry-wise ǫ-approximates M, and rank(M ′ ) = rank ǫ (M). Then

M tr,ǫ ≤ M ′ tr ( * ) ≤ M ′ Fr rank(M ′ ) ≤ k(1 + ǫ) rank(M ′ ) = k(1 + ǫ) rank ǫ (M),
where we used the Cauchy-Schwarz inequality for ( * ).

Bruck and Smolensky [START_REF] Bruck | Polynomial threshold functions, ac0 functions, and spectral norms[END_REF] provided an upper bound on the sign monomial complexity of a Boolean function in terms of its Fourier 1-norm. In fact, their proof gives an upper bound on the approximate monomial complexity too.

Theorem 2.3 ([BS92]). For any f : {0, 1} n → {0, 1}, mon ǫ (f ) ≤ 4n ǫ 2 f 2 1 .
Bruck [START_REF] Bruck | Harmonic analysis of polynomial threshold functions[END_REF] gave a lower bound on the sign monomial complexity of a Boolean function in terms of the Fourier infinity norm of f . Theorem 2.4 ( [START_REF] Bruck | Harmonic analysis of polynomial threshold functions[END_REF]). Let f : {0, 1} n → {0, 1} be a Boolean function. Then

mon ± (f ) ≥ 1 f ∞ .

Two-party functions

A capital function name will refer to a function with two inputs, e.g., F : X ×Y → {0, 1} where X and Y are some finite sets. We'll abuse notation and also use F to denote the |X | by |Y| matrix corresponding to F , i.e., the (x, y)'th entry of the matrix contains the value F (x, y). It will always be clear from the context whether F refers to a function or a matrix. Given f : {0, 1, . . . , n} → {0, 1}, we'll define f i : {0, 1, . . . , i} → {0, 1} by f i (j) = f (j). We denote by F ∧ n,f : {0, 1} n × {0, 1} n → {0, 1} the communication function such that F ∧ n,f (x, y) = f (|x ∧ y|). We use the notation F ∧ n,k,f k when the inputs x and y are promised to satisfy |x| = |y| = k. Similarly, we define F ⊕ n,f and F ⊕ n,k,f 2k , for k ≤ n/2. In an important paper, Razborov [START_REF] Razborov | Quantum communication complexity of symmetric predicates[END_REF] gave close to tight lower bounds on the randomized communication complexity of F ∧ n,f where f is a symmetric function. His main result can be stated as a lower bound on the approximate trace norm of a certain submatrix of

F ∧ n,f : Theorem 2.5 ([Raz03]). For k ≤ n/4, let f : {0, 1, . . . , k} → {0, 1}. If for some ℓ ≤ k/4 we have f (ℓ -1) = f (ℓ), then F ∧ n,k,f tr,1/4 ≥ n k e Ω( √ kℓ) .
We'll also need a result from Sherstov [START_REF] Sherstov | The multiparty communication complexity of set disjointness[END_REF] that gives essentially tight lower bounds on the sign-rank of all symmetric-and functions (see Section 4 for this result's relation to communication complexity).

Theorem 2.6 ([She12]

). Let f : {0, 1, . . . , n} → {0, 1}. Then

rank ± (F ∧ n,f ) ≥ 2 Ω(λ(f )/ log 5 n) .
Our main interest in 2-party functions is due to the tight links between the Fourier analytic properties of a Boolean function f : {0, 1} n → {0, 1} and the matrix analytic properties of F = F ⊕ n,f . Proposition 2.7 (Folklore). Let f : {0, 1} n → {0, 1} be any function and let F = F ⊕ n,f . Then (a) mon(f ) = rank(F ),

(b) mon ǫ (f ) ≥ rank ǫ (F ) (c) mon ± (f ) ≥ rank ± (F ), (d) 2 n f ∞ = F , (e) 2 n f 1 = F tr , (f ) 2 n f 1,ǫ = F tr,ǫ .

Main Results

Theorem 3.1. Let f : {0, 1} n → {0, 1} be a symmetric function. Then, Ω(r(f )) ≤ log mon 1/4 (f ) ≤ O r(f ) log n r(f ) .

Proof. Lower bound:

We first note that we may assume that r(f ) = r 0 (f ). In fact, if r(f ) = r 1 (f ), then we can consider the function f ′ defined as f ′ (i) = f (n -i). We note that mon ǫ (f ) = mon ǫ (f ′ ). To see this, given a function g approximating f with f -g ∞ ≤ ǫ, the function g ′ defined by g

′ (x 1 , . . . , x n ) = g(1 -x 1 , . . . , 1 -x n ) satisfies f ′ -g ′ ∞ ≤ ǫ and | g ′ (S)| = 2 -n | x g(x)χ S (1 -x 1 , . . . , 1 -x n )| = | g(S)|. This shows that mon 1/4 (f ) = mon 1/4 (f ′ ) ≥ r 0 (f ′ ). But we have f (n -r 1 (f ) -1) = f (n -r 1 (f ) + 1), i.e., f ′ (r 1 (f ) - 1) = f ′ (r 1 (f ) + 1) (except if r 1 (f ) = 0, but this case is simple). This implies that r 0 (f ′ ) ≥ r 1 (f ).
For the remainder of the proof, we assume there is an s ∈ {1, . . . , ⌈n/2⌉} such that f (s -1) = f (s + 1) and s ≥ r(f ).

In light of Proposition 2.7, part (b), our goal will be to show a lower bound on rank ǫ (F ⊕ n,f ). For any k, t such that 2k + t ≤ n, we define the submatrix

F ⊕ n-t,k,f 2k of F ⊕ n,f of size n-t k × n-t k by F ⊕ n-t,k,f 2k (x, y) = f (|x ⊕ y| + t)
for all x, y ∈ {0, 1} n-t . Note that this is for example the submatrix obtained by considering all the bitstrings x ′ , y ′ ∈ {0, 1} n for which the first t bits are set to one and among the remaining n -t bits, exactly k are set to 1.

Observe that |x ⊕ y|

= |x| + |y| -2|x ∧ y|. In particular, when |x| = |y| = k, |x ⊕ y| = 2k -2|x ∧ y|. This means that F ⊕ n-t,k,f 2k = F ∧ n-t,k,f ′ k , where f ′ k (i) = f 2k (2k -2i + t) for i ∈ {0
, 1, . . . , k}. Thus, we'll show a lower bound on the approximate-rank of F ∧ n-t,k,f ′ k . To do this, first we'll use Proposition 2.2, and show a lower bound on the approximate-trace norm. To show a lower bound on the approximate-trace norm, we'll use Theorem 2.5 and the fact that

f 2k (s -1) = f 2k (s + 1) =⇒ f ′ k k + t -(s -1) 2 = f ′ k k + t -(s + 1) 2 .
In other words, our choice for ℓ in Theorem 2.5 will be k + t-s-1 2 . Let's now specify k and t. Note that we should make sure that t -s -1 is even. We distinguish two cases depending on whether s ≤ 3(n -1)/8 or not.

If s ≤ 3(n -1)/8, then we simply set t = 0 if s is odd and t = 1 if s is even. Then we let k = ⌊ 2s 3 ⌋. Since s ≤ 3(n -1)/8, it is easy to check that k ≤ (n -t)/4 and ℓ ≤ k/4 as required by Theorem 2.5. So we have

F ⊕ n-t,k,f 2k tr,1/4 = F ∧ n-t,k,f ′ k tr,1/4 ≥ n -t k e Ω( √ kℓ) ,
which, by Proposition 2.2 and our choices for k and ℓ, implies

rank 1/4 (F ⊕ n-t,k,f 2k ) ≥ e Ω( √ kℓ) = e Ω(s) .
In the case s > 3(n -1)/8, we set t = ⌊n/4⌋ or t = ⌊n/4⌋ -1 depending on the parity of s, and k = ⌊2(s -1 -n/4)/3⌋. We then have k ≤ n/6 using the fact that s ≤ n/2 + 1. As t ≤ n/4, this implies that k ≤ n-t 4 . On the other hand, we have k = Ω(n). Now recall that ℓ = k + t-s-1 2 . But s+1-t 2 ≥ 3k/4 which implies that ℓ ≤ k/4. In addition, as s > 3(n -1)/8, we also have ℓ = Ω(n). As a result, we can apply Theorem 2.5 and obtain

rank 1/4 (F ⊕ n-t,k,f 2k ) ≥ e Ω( √ kℓ) = e Ω(s) .
Using Proposition 2.7 part (b), we obtain the desired result.

Upper bound: Using Theorem 2.3, we have mon 1/4 (f ) ≤ 64n f 2 1 . Taking the logarithm and using Theorem 2.1 we get the desired result.

Theorem 3.2. Let f : {0, 1} n → {0, 1} be a symmetric function. Then,

Ω(ρ(f )/ log 5 n) ≤ log mon ± (f ) ≤ O(1 + ρ(f ) log n).

Proof. Lower bound:

First, we'll assume |{i ∈ [2, 2n/3] : f (i) = f (i -2) and i is even}| is a constant fraction of ρ(f ). At the end of the proof, we give an argument for when this is not true.

In light of Proposition 2.7, part (c), our goal is to show that

log rank ± (F ⊕ n,f ) = Ω(ρ(f )/ log 5 n). (1)
Since F ⊕ n,n/3,f 2n/3 is a submatrix of F ⊕ n,f , it suffices to show a lower bound on the sign-rank of F ⊕ n,n/3,f 2n/3 . As in the proof of Theorem 3.1,

F ⊕ n,n/3,f 2n/3 = F ∧ n,n/3,f ′ n/3
, where f ′ n/3 (i) = f 2n/3 (2n/3 -2i) for i ∈ {0, 1, . . . , n/3}. From the assumption we made at the beginning of the proof, we know that λ(f ′ n/3 ) = Ω(ρ(f )). By Theorem 2.6, we know that

log rank ± (F ∧ n/3,f ′ n/3 ) = Ω(λ(f ′ n/3 )/ log 5 (n/3)).
We show that the above implies

log rank ± (F ∧ n,n/3,f ′ n/3 ) = Ω(λ(f ′ n/3 )/ log 5 (n/3)), (2)
∧ y| = |x ′ ∧ y ′ |. So F ∧ n/3,f ′ n/3 is a submatrix of F ∧ n,n/3,f ′ n/3
. This establishes (2), and therefore (1). This completes the proof for the case when |{i ∈ [2, 2n/3] : f (i) = f (i -2) and i is even}| is a constant fraction of ρ(f ). If the changes f (i) = f (i -2) are happening mostly at odd indices i, then consider the restriction of f in which one input variable is set to 1. If f ′ is this restriction, then F ⊕ n-1,f ′ is a submatrix of F ⊕ n,f and therefore it suffices to show a lower bound on rank

± (F ⊕ n-1,f ′ ). If |{i ∈ [2, 2n/3] : f (i) = f (i -2)}| is not a constant fraction of ρ(f ), then consider the function f ′ defined as f ′ (i) = f (n -i). This f ′ is such that |{i ∈ [2, 2n/3] : f ′ (i) = f ′ (i -2)}| a constant fraction of ρ(f ) = ρ(f ′ ). Furthermore, note that F ⊕ n,f = F ⊕ n,f ′
as one is obtained from the other by rearranging the columns. Therefore it suffices to show a lower bound on rank ± (F ⊕ n,f ′ ).

Upper bound:

We'll prove by induction on ρ(f ) that mon ± (f ) ≤ (n + 2) ρ(f ) . If ρ(f ) = 0 then f is either a constant function or a parity function (parity or its negation), and so can be represented exactly using at most two non-zero Fourier coefficients. We also have to explicitly prove the ρ(f ) = 1 case. Let's consider the function f with f (i) = parity(i) for i < t and f (i) = 0 for i ≥ t, for some t. Observe that the following polynomial sign represents f : (2t -0.1)(-1) x 1 +x 2 +...+xn + ((-1)

x 1 + (-1) x 2 + • • • + (-1) xn -n).
So mon ± (f ) ≤ n+2. By slightly modifying the above polynomial, we can sign represent any function that behaves like a parity function (parity or its negation) for i ≤ t and behaves like a constant function for i > t. We can also sign represent any function that behaves like a constant function for i ≤ t and behaves like a parity function for i > t. These are the only cases to consider for ρ(f ) = 1. Now suppose ρ(f ) > 1. Let j be the largest index such that f (j) = f (j -2). Let f ′ be the function obtained from f as follows: f ′ (i) = f (i) for i < j and f ′ (i) = f ′ (i -2) for i ≥ j. Observe that ρ(f ′ ) = ρ(f ) -1. Let p ′ be a sign representing polynomial for f ′ with at most (n + 2) ρ(f ′ ) = (n + 2) ρ(f )-1 monomials. Let f ′′ be the function obtained from f as follows: f ′′ (i) = 1 for i < j and either f ′′ (i) = parity(i) for i ≥ j or f ′′ (i) = ¬parity(i) for i ≥ j. Observe that ρ(f ′′ ) = 1, and so it has a sign representing polynomial p ′′ with at most n + 2 monomials. The functions f ′ and f ′′ are constructed in a way so that the product p ′ • p ′′ sign represents f (in particular, the choice of f ′′ (i) = parity(i) or f ′′ (i) = ¬parity(i) for i ≥ j is made accordingly). Therefore mon ± (f ) ≤ (n + 2) ρ(f ) .

As a corollary to the upper bound above, we can give a lower bound on the Fourier infinity norm of a symmetric function.

Corollary 3.3. Let f : {0, 1} n → {0, 1} be a symmetric function. Then

f ∞ ≥ 1 (n + 2) ρ(f ) .
Proof. From the proof of Theorem 3.2, we have mon ± (f ) ≤ (n + 2) ρ(f ) . Combining this with Theorem 2.4 gives the desired bound.

We now prove the main conjecture of [START_REF] Ada | Spectral norm of symmetric functions[END_REF].

Theorem 3.4. Let f : {0, 1} n → {0, 1} be a symmetric function. Then,

Ω(r(f )) - 1 2 log n ≤ log f 1,1/5 ≤ log f 1 ≤ O r(f ) log n r(f ) .
Proof. The upper bound is in Theorem 2.1. For the lower bound, let g be such that f 1,1/5 = g 1 . Applying Theorem 2.3 with ǫ = 1/20, we get g 1 ≥ ǫ 2 √ n mon 1/20 (g). By the triangle inequality, we have mon 1/20 (g) ≥ mon 1/4 (f ). Thus, log f 1,1/5 ≥ 1 2 log mon 1/4 (f ) -1 2 log n -log 40 .

To conclude, it suffices to use Theorem 3.1

,

  as follows. Given x, y ∈ {0, 1} n/3 , construct (by padding x and y appropriately with 2n/3 bits each) x ′ , y ′ ∈ {0, 1} n with the property that the Hamming weights |x ′ | = |y ′ | = n/3 and the strings don't intersect at indices i ∈ [n/3 + 1, n]. Clearly the mappings x → x ′ and y → y ′ are injective, and |x

Applications to Communication Complexity

We denote by R ǫ (F ) the ǫ-error randomized communication complexity of F . In this model, the players are allowed to share randomness and for all inputs, they are required to output the correct answer with probability at least 1 -ǫ. We'll think of ǫ as some constant less than 1/2.

Here we'll also be interested in the unbounded-error randomized communication complexity of a function F : X × Y → {0, 1}, denoted U(F ). In this model, the players have private randomness and the only requirement from the protocol is that for all inputs, it gives the correct answer with probability greater than 1/2. Notice that achieving error probability 1/2 is trivial: just output a random bit. Also, note that there is no requirement that the success probability be bounded away from 1/2, e.g., the success probability could be 1/2 + 1/2 n . This makes the model quite powerful and proving lower bounds much harder. It was shown in [START_REF] Paturi | Probabilistic communication complexity[END_REF] that

In a remarkable paper [START_REF] Forster | A linear lower bound on the unbounded error probabilistic communication complexity[END_REF], Forster was able to prove a lower bound on the unbounded error communication complexity of a function using the function's spectral norm. In particular he was able to show a linear lower bound for the inner-product function. Building on Forster's work, Sherstov [START_REF] Sherstov | The multiparty communication complexity of set disjointness[END_REF] gave essentially tight lower bounds on the unbounded error communication complexity of all symmetric-and functions F ∧ n,f (see Theorem 2.6).

In [START_REF] Zhang | Communication complexities of symmetric xor functions[END_REF], Shi and Zhang conjecture that the unbounded error communication complexity of a symmetric-xor function F ⊕ n,f is characterized by ρ(f ). We prove this conjecture. First, the proof Theorem 3.2 allows us to bound the sign-rank of symmetric-xor functions.

Theorem 4.1. Let f : {0, 1} n → {0, 1} be a symmetric function. Then,

This immediately implies:

Corollary 4.2. Let f : {0, 1} n → {0, 1} be a symmetric function. Then,

The second application is related to the Log Approximation Rank Conjecture, which is the randomized communication complexity analog of the famous Log Rank Conjecture. The Log Approximation Rank Conjecture states that there is a constant c such that for any 2-party function F ,

Here, the lower bound is well-known to be true for all functions, so the conjecture is about establishing the upper bound. This has been done by Razborov [Raz03] for symmetric-and functions F ∧ n,f . We show that the conjecture holds also for symmetricxor functions F ⊕ n,f . Theorem 4.3. There are constants ǫ, ǫ ′ , c > 0 such that for any two-party function F ⊕ n,f , where f is symmetric, we have

Proof. By Proposition 3.4 of [START_REF] Zhang | Communication complexities of symmetric xor functions[END_REF], we know that R ǫ (F ⊕ n,f ) ≤ O(r(f ) log 2 r(f ) log log r(f )).

The proof of Theorem 3.1 allows us to conclude that log rank 1/4 (F ⊕ n,f ) ≥ Ω(r(f )).

Combining the two bounds proves the result.