University of Cambridge > > Combinatorics Seminar > The minimum modulus of a covering system is at most 10^19

The minimum modulus of a covering system is at most 10^19

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

  • UserBob Hough (University of Cambridge)
  • ClockThursday 05 December 2013, 14:30-15:30
  • HouseMR12.

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

Abstract: A distinct covering system of congruences is a collection

a_i mod m_i, 1 < m_1 < m_2 < ... < m_k

such that every integer satisfies at least one of them. Erd\H{o}s asked whether there exist covering systems for which m_1 is arbitrarily large. I have recently found a negative answer to this question. I will describe aspects of the proof, which uses in a crucial way a relative form of the Lov\’asz Local Lemma.

This talk is part of the Combinatorics Seminar series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.


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