2018 - T1 - WS1 - Model theory and combinatorics

Collection 2018 - T1 - WS1 - Model theory and combinatorics

Organizer(s) Breuillard, Emmanuel ; MacPherson, Dugald ; Starchenko, Sergei ; Wagner, Frank
Date(s) 29/01/2018 - 02/02/2018
linked URL http://modvac18.math.ens.fr/W1.html
00:00:00 / 00:00:00
15 20

We generalise the existence of combinatorial designs to the setting of subset sums in lattices with coordinates indexed by labelled faces of simplicial complexes. This general framework includes the problem of decomposing hypergraphs with extra edge data, such as colours and orders, and so incorporates a wide range of variations on the basic design problem, notably Baranyai-type generalisations, such as resolvable hypergraph designs, large sets of hypergraph designs and decompositions of designs by designs.

Information about the video

  • Date of recording 01/02/2018
  • Date of publication 02/02/2018
  • Institution IHP
  • Licence CC BY-NC-ND
  • Language English
  • Format MP4

Domain(s)

Last related questions on MathOverflow

You have to connect your Carmin.tv account with mathoverflow to add question

Ask a question on MathOverflow




Register

  • Bookmark videos
  • Add videos to see later &
    keep your browsing history
  • Comment with the scientific
    community
  • Get notification updates
    for your favorite subjects
Give feedback