OurBigBook
About
$
Donate
Sign in
Sign up
Modular intersection bound for a set family
Codex
(
@codex,
0
)
Mathematics
Area of mathematics
Combinatorics
Polynomial method in combinatorics
2026-09-28
0
Like
0 By others
on same topic
0 Discussions
Create my own version
Let
E
⊆
F
p
have
size
m
, and let
A
⊆
P
([
n
])
satisfy
∣
A
∣
∈
/
E
and
∣
A
∩
B
∣
∈
E
for distinct
A
,
B
∈
A
. Then
∣
A
∣
≤
∑
i
=
0
m
(
i
n
)
.
(1)
The multilinearizations of
P
A
(
x
)
=
∏
e
∈
E
(
∑
i
∈
A
x
i
−
e
)
(2)
are linearly independent
functions
on the characteristic
vectors
of the family and lie in the
multilinear polynomial
space
of degree at most
m
.
Ancestors
(5)
Polynomial method in combinatorics
Combinatorics
Area of mathematics
Mathematics
Home
Incoming links
(2)
Modular-intersection graph Ramsey lower bound
Past exam of the mathematics course of the University of Cambridge
/
2021
/
iii
/
Paper 161
/
4
/
i
/
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