University of Cambridge > Talks.cam > Trinity Mathematical Society > Compressions in Extremal Combinatorics

  Browse A-Z

Log in

Cambridge users (raven)details Other usersdetails No account?details

Information on

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

Compressions in Extremal Combinatorics

Add to your list(s) Download to your calendar using vCal

If you have a question about this talk, please contact Mary Fortune.

Part of the TMS Symposium

How big can a family of finite sets satisfying some property be? One obstacle to answering this type of question is a lack of structure. Compressions are one way of imposing structure on families of sets. What are they, and what can we use them to find out?

This talk is part of the Trinity Mathematical Society series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.

Other lists

Ver Heyden de Lancey Lectures Semitic linguistics The Fitzwilliam Museum

Other talks

The Anne McLaren Lecture: CRISPR-Cas Gene Editing: Biology, Technology and Ethics Value generalization during human avoidance learning Around the world in 605 State energy agreements Martin Roth: »Widerrede!« TODAY Foster Talk - "Paraspeckles, TDP-43 & alternative polyadenylation: how regulation of a membraneless compartment guides cell fate" Not 'just a GP' Market Socialism and Community Rating in Health Insurance A new proposal for the mechanism of protein translocation Symplectic topology of K3 surfaces via mirror symmetry "Mechanosensitive regulation of cancer epigenetics and pluripotency" Fields of definition of Fukaya categories of Calabi-Yau hypersurfaces Determining structures in situ using cryo-electron tomography:enveloped viruses and coated vesicles
 

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