A Ramsey Characterisation of Eventually Perioidic Words

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

• Maria Ivan (Cambridge)
• Thursday 25 January 2024, 14:30-15:30
• MR12.

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

A factorisation x = u1 u2 · · · of an infinite word x on alpha- bet X is called ‘super-monochromatic’, for a given colouring of the finite words X∗ on alphabet X, if each word uk1 uk2 · · · ukn , where k1 < · · · < kn, is the same colour. A direct application of Hindman’s theorem shows that if x is eventually periodic, then for every finite colouring of X∗, there ex- ist a suffix of x that admits a super-monochromatic factorisation. What about the converse? In this talk we show that the converse does indeed hold: thus a word x is eventually periodic if and only if for every finite colouring of X∗ there is a suffix of x having a super-monochromatic factorisation. This has been a conjecture in the community for some time. Our main tool is a Ramsey result about alternating sums. This provides a strong link between Ramsey theory and the combinatorics of infinite words. Joint work with Imre Leader and Luca Q. Zamboni

This talk is part of the Combinatorics Seminar series.

This talk is included in these lists:

• All CMS events
• All Talks (aka the CURE list)
• CMS Events
• Combinatorics Seminar
• DPMMS Lists
• DPMMS Pure Maths Seminar
• DPMMS info aggregator
• DPMMS lists
• Hanchen DaDaDash
• Interested Talks
• MR12
• School of Physical Sciences
• bld31

Note that ex-directory lists are not shown.