Junta threshold for low degree Boolean functions on the slice (Q2699646)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7676073
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Junta threshold for low degree Boolean functions on the slice |
scientific article; zbMATH DE number 7676073 |
Statements
Junta threshold for low degree Boolean functions on the slice (English)
0 references
19 April 2023
0 references
Summary: We show that a Boolean degree \(d\) function on the slice \(\binom{[n]}{k}\) is a junta if \(k \geqslant 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.
0 references
0 references
0.8945789
0 references
0.83914655
0 references
0.83665425
0 references
0.8355617
0 references
0.8338068
0 references
0.8332333
0 references
0.8298979
0 references
0.8289331
0 references
