University of Cambridge > Talks.cam > Combinatorics Seminar > A new algebraic approach to the wreath conjecture

  Browse A-Z

Log in

University Account External (via Google)

🔐 Log In

Information on

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

ℹ️ Information

A new algebraic approach to the wreath conjecture

Download to your calendar using vCal

  • UserSpeaker to be confirmed
  • ClockThursday 13 February 2025, 14:30-15:30
  • HouseMR12.

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

In 1970s, Baranyai proved that the hyperedges of the k-uniform complete hypergraph on n vertices can be decomposed into perfect matchings whenever k divides n. In the same paper, he posed a more general conjecture. Katona, who later rephrased this conjecture as decomposing [n]^(k) into so-called wreaths, wrote “Baranyai’s brilliant idea was to use matrices and flows in networks. This conjecture, however, seems to be too algebraic. One does not expect to solve it without algebra. (Unless it is not true.)”. In this talk, we will discuss a new algebraic approach to the wreath conjecture, defining a matrix encoding the problem and studying its properties. (based on joint work with Pavel Turek)

This talk is part of the Combinatorics Seminar series.

This talk is included in these lists:

Note that ex-directory lists are not shown.

Other lists

16 Mill Lane DMB GS5, Faculty of Education, Hills Road, Cambridge CB2 8PH Dr Constance Tipper Lecture Theatre, Department of Engineering

Other talks

An AI-Assisted Proof in Spectral Geometry Title to be confirmed Morning Break Ensemble inequivalence for systems with long-range interactions Coming soon Morning Break / Group Photo
 

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