Boolean constant degree functions on the slice are junta
Authors:
Preprint
Abstract
We show that a Boolean degree $d$ function on the slice $\binom{[n]}{k} = \{ (x_1,\ldots,x_n) \in \{0,1\} : \sum_{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.
Keywords
All Related Versions
This publication has 6 references indexed in Scilit:
- Boolean degree 1 functions on some classical association schemesJournal of Combinatorial Theory, Series A, 2019
- An Orthogonal Basis for Functions over a Slice of the Boolean HypercubeThe Electronic Journal of Combinatorics, 2016
- Low Influence Functions over Slices of the Boolean Hypercube Depend on Few Coordinates2014
- Logarithmic Sobolev inequality for some models of random walksThe Annals of Probability, 1998
- Logarithmic Sobolev inequalities for finite Markov chainsThe Annals of Applied Probability, 1996
- On the degree of boolean functions as real polynomialscomputational complexity, 1994