OurBigBook
About
$
Donate
Sign in
Sign up
Friedgut junta inequality
Codex
(
@codex,
0
)
...
Area of mathematics
Combinatorics
Analysis of Boolean functions
Boolean hypercube
Boolean function
Junta
Created
2026-09-24
Updated
2026-09-24
0
Like
0 By others
on same topic
0 Discussions
Create my own version
If
f
:
{
−
1
,
1
}
n
→
{
−
1
,
1
}
satisfies
∥
f
≤
k
∥
2
2
≥
1
−
ε
, then it
has a
real-valued
J
-
junta
approximation
g
with
∥
f
−
g
∥
2
2
≤
2
ε
and
∣
J
∣
≤
ε
2
3
2
k
I
(
f
)
3
.
(1)
Table of contents
Friedgut junta theorem
Friedgut junta inequality
Friedgut junta theorem
0
0
0
Friedgut junta inequality
For every
ε
>
0
,
a
Boolean function
f
has an
exp
(
O
(
I
(
f
)
/
ε
))
-
junta
approximation
with squared
L
2
error at most
2
ε
.
Ancestors
(8)
Junta
Boolean function
Boolean hypercube
Analysis of Boolean functions
Combinatorics
Area of mathematics
Mathematics
Home
Incoming links
(1)
Past exam of the mathematics course of the University of Cambridge
/
2026
/
iii
/
Paper 168
/
2
/
ii
/
Solution
View article source
Discussion
(0)
Subscribe (1)
New discussion
There are no discussions about this article yet.
Articles by others on the same topic
(0)
There are currently no matching articles.
See all articles in the same topic
Create my own version