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

## The Junta Method for HypergraphsAdd to your list(s) Download to your calendar using vCal - Noam Lifschitz (Bar-Ilan University)
- Thursday 31 May 2018, 14:30-15:30
- MR13.
If you have a question about this talk, please contact Andrew Thomason. Numerous problems in extremal hypergraph theory ask to determine the maximal size of a k-uniform hypergraph on n vertices that does not contain an ‘enlarged’ copy H In this talk we present a general approach to such problems, using a ‘junta approximation method’ that originates from analysis of Boolean functions. We prove that any (H Based on joint works with David Ellis and Nathan Keller 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
- MR13
- School of Physical Sciences
- bld31
Note that ex-directory lists are not shown. |
## Other listsThe Annual Adrian Lecture Doctor Who Society Talks## Other talksAlex Hopkins Lecture Can you live to see a better day? Lifestyle engagement predicts healthy cognitive development in old age (a Cam-CAN study) BSU Seminar: “Exchangeable Random Measures for Sparse and Modular Graphs with Overlapping Communities” The Science of Goo Beyond crazy: Rationality, irrationality, and conspiracy theory Brand Antarctica: Advertising and the South |