AbstractIn this note we describe Boolean functions f(x1,x2,…,xn) whose Fourier coefficients are concentrated on the lowest two levels. We show that such a function is close to a constant function or to a function of the form f=xk or f=1−xk. This result implies a “stability” version of a classical discrete isoperimetric result and has an application in the study of neutral social choice functions. The proofs touch on interesting harmonic analysis issues
The topic of discrete Fourier analysis has been extensively studied in recent decades. It plays an i...
Abstract. This paper makes two contributions towards determining some well-studied optimal constants...
Abstract: Let f: {−1,1}n → R be a real function on the hypercube, given by its discrete Fourier expa...
AbstractIn this note we describe Boolean functions f(x1,x2,…,xn) whose Fourier coefficients are conc...
This article accompanies a tutorial talk given at the 40th ACM STOC conference. In it, we give a bri...
This article accompanies a tutorial talk given at the 40th ACM STOC conference. In it, we give a bri...
This article accompanies a tutorial talk given at the 40th ACM STOC conference. In it, we give a bri...
Abstract. We present a range of new results for testing properties of Boolean functions that are def...
We present a range of new results for testing properties of Boolean functions that are defined in te...
Abstract. We present a range of new results for testing properties of Boolean functions that are def...
Boolean Function Analysis, the study of functions on the Boolean cube {0,1}^n, forms an essential pa...
In this paper we prove results regarding Boolean functions with small spectral norm (the spectral no...
Abstract. We present a range of new results for testing properties of Boolean functions that are def...
We prove that Boolean functions on Sn, whose Fourier transform is highly concentrated on irreducible...
The topic of discrete Fourier analysis has been extensively studied in recent decades. It plays an i...
The topic of discrete Fourier analysis has been extensively studied in recent decades. It plays an i...
Abstract. This paper makes two contributions towards determining some well-studied optimal constants...
Abstract: Let f: {−1,1}n → R be a real function on the hypercube, given by its discrete Fourier expa...
AbstractIn this note we describe Boolean functions f(x1,x2,…,xn) whose Fourier coefficients are conc...
This article accompanies a tutorial talk given at the 40th ACM STOC conference. In it, we give a bri...
This article accompanies a tutorial talk given at the 40th ACM STOC conference. In it, we give a bri...
This article accompanies a tutorial talk given at the 40th ACM STOC conference. In it, we give a bri...
Abstract. We present a range of new results for testing properties of Boolean functions that are def...
We present a range of new results for testing properties of Boolean functions that are defined in te...
Abstract. We present a range of new results for testing properties of Boolean functions that are def...
Boolean Function Analysis, the study of functions on the Boolean cube {0,1}^n, forms an essential pa...
In this paper we prove results regarding Boolean functions with small spectral norm (the spectral no...
Abstract. We present a range of new results for testing properties of Boolean functions that are def...
We prove that Boolean functions on Sn, whose Fourier transform is highly concentrated on irreducible...
The topic of discrete Fourier analysis has been extensively studied in recent decades. It plays an i...
The topic of discrete Fourier analysis has been extensively studied in recent decades. It plays an i...
Abstract. This paper makes two contributions towards determining some well-studied optimal constants...
Abstract: Let f: {−1,1}n → R be a real function on the hypercube, given by its discrete Fourier expa...