Events

Annual Dinner

The Archimedeans Annual Dinner is a prestigious event that brings together members, alumni, and faculty members to celebrate the society’s achievements and strengthen connections within the mathematical community. Scheduled to take place on March 1st at The Hilton Hotel, the evening promises a blend of tradition, inspiration, and camaraderie.

The event begins with a warm welcome at the reception, where guests will enjoy a champagne toast and hors d’oeuvres. This is an opportunity for attendees to mingle and set the tone for the evening. Following this, a formal three-course dinner will be served, accompanied by carefully selected wine and soft drinks. The seating arrangements will be designed to encourage networking and lively conversation among members and guests.

Tickets will be available for purchase soon, so pay attention to your inbox! Join us for a memorable evening that celebrates the rich legacy of the Archimedeans and sets the stage for future accomplishments.

The first talk of Lent!

Title: Strategies, infinite games and catching robbers

Abstract: The game of cops and robbers is played on a fixed graph G. The cop picks a vertex to start at, and the robber then does the same. Then they move alternately, with the cop moving first: at each turn the player moves to an adjacent vertex or does not move. The game is won by the cop if he lands on the robber. The graph G is called cop-win if the cop has a winning strategy, and weak cop-win if the cop has a strategy that ensures that the robber is either caught or visits each vertex only finitely many times. How can we characterise the graphs on which we can, if we are smart enough, catch the robber? On a finite graph, we know the answer exactly. These are called `constructible’ graphs: obtained recursively from the one-point graph by repeatedly adding dominated vertices. What about infinite graphs? This notion totally fails to describe the cop-win graphs. In this talk we investigate the relation between constructible graphs and cop-win or weak cop-win graphs. We also investigate how these notions relate to the (weaker and more natural) notion of ‘locally constructible’ (every finite subgraph is contained in a finite constructible subgraph). It turns out that we can have exotic examples, locally constructible, on which the robber can outsmart the robber.