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 By others on same topic  0 Discussions Create my own version
Let E⊆Fp​ have size m, and let A⊆P([n]) satisfy ∣A∣∈/E and ∣A∩B∣∈E for distinct A,B∈A. Then
∣A∣≤∑i=0m​(in​).
(1)
The multilinearizations of
PA​(x)=∏e∈E​(∑i∈A​xi​−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)

  1. Polynomial method in combinatorics
  2. Combinatorics
  3. Area of mathematics
  4. Mathematics
  5.  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)

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
 About$ Donate Content license: CC BY-SA 4.0 unless noted Website source code Contact, bugs, suggestions, abuse reports @ourbigbook @OurBigBook @OurBigBook