COOKIES: By using this website you agree that we can place Google Analytics Cookies on your device for performance monitoring. |

## Forbidden vector-valued intersectionsAdd to your list(s) Download to your calendar using vCal - Eoin Long (University of Oxford)
- Thursday 26 January 2017, 14:30-15:30
- MR12.
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:- All CMS events
- All Talks (aka the CURE list)
- CMS Events
- Combinatorics Seminar
- DPMMS Lists
- DPMMS Pure Maths Seminar
- DPMMS info aggregator
- DPMMS lists
- MR12
- School of Physical Sciences
- bld31
Note that ex-directory lists are not shown. |
## Other listsImagine2027 Exploring modern South Asian history with visual research methods: theories and practices CAPE-CIKC Advanced Technology Lectures## Other talksAnimal Migration Description: TIE proteins: chemical harpoons of Gram-positive bacteria Cycloadditions via TMM-Pd Intermediates: New Strategies for Asymmetric Induction and Total Synthesis Identification of Active Species and Mechanistic Pathways in the Enantioselective Catalysis with 3d Transition Metal Pincer Complexes Calcium signalling in bipolar disorder - new twists to an old story Acceleration of tropical cyclogenesis by self-aggregation feedbacks |