More designs

291 views · Published 2 February 2018 · 51:28 · Indexed 6 November 2026

Channel: Institut Henri Poincaré · 2018 · Science & Technology

Watch on YouTube

By Peter Keevash (Oxford)
Abstract: 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.

More from this channel