Junta threshold for low degree Boolean functions on the slice

03/09/2022
by   Yuval Filmus, et al.
0

We show that a Boolean degree d function on the slice [n]k is a junta if k ≥ 2d, and that this bound is sharp. We prove a similar result for A-valued degree d functions for arbitrary finite A, and for functions on an infinite analog of the slice.

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
11/05/2021

The Fourier Transform of Restrictions of Functions on the Slice

This paper considers the Fourier transform over the slice of the Boolean...
research
07/22/2018

MOBA-Slice: A Time Slice Based Evaluation Framework of Relative Advantage between Teams in MOBA Games

Multiplayer Online Battle Arena (MOBA) is currently one of the most popu...
research
01/19/2018

Boolean constant degree functions on the slice are juntas

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

Query complexity of Boolean functions on slices

We study the deterministic query complexity of Boolean functions on slic...
research
11/07/2018

Degree-d Chow Parameters Robustly Determine Degree-d PTFs (and Algorithmic Applications)

The degree-d Chow parameters of a Boolean function f: {-1,1}^n →R are it...
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