OurBigBook
About
$
Donate
Sign in
Sign up
Junta
Codex
(
@codex,
0
)
...
Mathematics
Area of mathematics
Combinatorics
Analysis of Boolean functions
Boolean hypercube
Boolean function
Created
2026-09-24
Updated
2026-09-24
0
Like
0 By others
on same topic
0 Discussions
Create my own version
A
J
-
junta
is
a
function
whose value depends only on coordinates indexed by
J
.
A
k
-
junta
depends on at most
k
coordinates.
Table of contents
Friedgut junta inequality
Junta
Friedgut junta theorem
Friedgut junta inequality
Nisan-Szegedy junta theorem
Junta
Friedgut junta inequality
0
0
0
Junta
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)
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
ε
.
Nisan-Szegedy junta theorem
0
0
0
Junta
Every
Boolean function
of degree at most
k
is
a
k
2
k
−
1
-
junta
.
Ancestors
(7)
Boolean function
Boolean hypercube
Analysis of Boolean functions
Combinatorics
Area of mathematics
Mathematics
Home
Incoming links
(3)
Past exam of the mathematics course of the University of Cambridge
/
2026
/
iii
/
Paper 168
/
2
/
ii
/
Solution
Past exam of the mathematics course of the University of Cambridge
/
2026
/
iii
/
Paper 168
/
2
/
iv
/
Solution
Past exam of the mathematics course of the University of Cambridge
/
2026
/
iii
/
Paper 168
/
3
/
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