University of Birmingham > Talks@bham > Combinatorics and Probability seminar > Counting hypergraph colorings in the local lemma regime

## Counting hypergraph colorings in the local lemma regimeAdd to your list(s) Download to your calendar using vCal - Heng Guo (University of Edinburgh)
- Thursday 31 January 2019, 13:00-14:00
- Watson LTB.
If you have a question about this talk, please contact Richard Montgomery. I will present a fully polynomial-time approximation scheme (FPTAS) to count the number of q-colorings for k-uniform hypergraphs with maximum degree D if k>=28 and q>315D^{14/(k−14)}, as well as an accompanying sampling algorithm with slightly worse conditions. These are the first approximate counting and sampling algorithms in the regime q\ll Δ (for large Δ and k) without any additional assumptions. In these regimes, frozen colourings are present, forming an obstacle to the standard Markov chain Monte Carlo approach. Instead, our method is based on the recent work of Moitra (STOC, 2017), in which Lovasz Local Lemma is the key ingredient. Joint work with Chao Liao, Pinyan Lu, Chihao Zhang This talk is part of the Combinatorics and Probability seminar series. ## This talk is included in these lists:Note that ex-directory lists are not shown. |
## Other listsContemporary History Seminar Computer Science Departmental Series Midlands Logic Seminar## Other talksSignatures of structural criticality and universality in the cellular anatomy of the brain Many-body localization from Hilbert- and real-space points of view Provably Convergent Plug-and-Play Quasi-Newton Methods for Imaging Inverse Problems Topological magnons and quantum magnetism The percolating cluster is invisible to image recognition with deep learning [Friday seminar]: Irradiated brown dwarfs in the desert |