University of Cambridge > Talks.cam > Combinatorics Seminar > Forbidden vector-valued intersections

  Browse A-Z

Log in

Googledetails Microsoftdetails

🔐 Log In

Information on

Subscribing to talksdetails Finding a talkdetails Adding a talkdetails Disseminating talksdetails Help and Documentationdetails

ℹ️ Information

Forbidden vector-valued intersections

Download to your calendar using vCal

  • UserEoin Long (University of Oxford)
  • ClockThursday 26 January 2017, 14:30-15:30
  • HouseMR12.

If you have a question about this talk, please contact Andrew Thomason .

Given vectors V = (v_i: i \in [n]) in R^D, we define the V-intersection of A,B \subset [n] to be the vector sum_{i \in A \cap B} v_i. In this talk I will discuss a new, essentially optimal, supersaturation theorem for V-intersections, which can be roughly stated as saying that any large family of sets contains many pairs (A,B) with V-intersection w, for a wide range of V and w. A famous theorem of Frankl and Rödl corresponds to the case D=1 and all v_i=1 of our theorem. The case D=2 and v_i=(1,i) solves a conjecture of Kalai.

Joint work with Peter Keevash.

This talk is part of the Combinatorics Seminar series.

This talk is included in these lists:

Note that ex-directory lists are not shown.

Other lists

How to Find Your Router Login and Password Pragmatics reading group 2012-13 FW 11, William Gates Building. Zoom link: https://cl-cam-ac-uk.zoom.us/j/4361570789?pwd=Nkl2T3ZLaTZwRm05bzRTOUUxY3Q4QT09&from=addon

Other talks

Climate, uncertainty, and the slippery measurement of Antarctic ice Cooperation as a Laboratory of Being Title TBC Group Presentation 1 Tea and Coffee Break Not-so-noble gases, key tracers of Earth’s habitability: what their behaviour in planetary interiors can tell us?
 

© 2006-2025 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity