Boolean constant degree functions on the slice are juntas

01/19/2018
by   Yuval Filmus, et al.
0

We show that a Boolean degree d function on the slice [n]k = { (x_1,...,x_n) ∈{0,1} : ∑_i=1^n x_i = k } is a junta, assuming that k,n-k are large enough. This generalizes a classical result of Nisan and Szegedy on the hypercube. Moreover, we show that the maximum number of coordinates that a Boolean degree d function can depend on is the same on the slice and the hypercube.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
01/19/2018

Boolean constant degree functions on the slice are junta

We show that a Boolean degree d function on the slice [n]k = { (x_1,...,...
research
03/09/2022

Junta threshold for low degree Boolean functions on the slice

We show that a Boolean degree d function on the slice [n]k is a junta if...
research
01/25/2019

A structure theorem for almost low-degree functions on the slice

The Fourier-Walsh expansion of a Boolean function f {0,1}^n →{0,1} is it...
research
09/10/2018

FKN theorem for the multislice, with applications

The Friedgut-Kalai-Naor (FKN) theorem states that if f is a Boolean func...
research
11/29/2022

Query complexity of Boolean functions on slices

We study the deterministic query complexity of Boolean functions on slic...
research
02/20/2023

DenseQMC: an efficient bit-slice implementation of the Quine-McCluskey algorithm

This note describes a new efficient bit-slice implementation DenseQMC of...
research
04/22/2018

Boolean functions on high-dimensional expanders

We initiate the study of Boolean function analysis on high-dimensional e...

Please sign up or login with your details

Forgot password? Click here to reset