BEGIN:VCALENDAR
PRODID:-//Columba Systems Ltd//NONSGML CPNG/SpringViewer/ICal Output/3.3-
 M3//EN
VERSION:2.0
CALSCALE:GREGORIAN
METHOD:PUBLISH
BEGIN:VEVENT
DTSTAMP:20260420T124744Z
DTSTART:20260421T140000Z
DTEND:20260421T150000Z
SUMMARY:Manchester Number Theory Seminar - Tomasz Kosciuszko
UID:{http://www.columbasystems.com/customers/uom/gpp/eventid/}x1u4-mmpi3f
 3g-eo6997
DESCRIPTION:Speaker: Tomasz Kosciuszko\n\nTitle: Schur-like numbers and a
  lemma of Shearer\n\nAbstract: Suppose that we colour all integers from 
 1 to N with n colours. The question of Schur asks about the largest N fo
 r which this can be done without creating any monochromatic sums. The ex
 act answer is not known and the factorial bound that Schur proposed has 
 not been improved since 1917.  Exactly 100 years later Cwalina and Schoe
 n considered the same problem generalized to other non-invariant equatio
 ns. In particular they gave a superior bound for an equation in 5 variab
 les. We further improve their result\, employing a tool from Graph Theor
 y - Shearer's lemma. In this talk we will sketch the proof and give some
  motivation as well as discuss several related problems and results. \n\
 nRoom: Frank Adams 1
STATUS:TENTATIVE
TRANSP:TRANSPARENT
CLASS:PUBLIC
LOCATION:Frank Adams 1\, Alan Turing Building\, Manchester
END:VEVENT
END:VCALENDAR