The Game of Plates and Olives

Abstract

The game of plates and olives, introduced by Nicolaescu, begins with an empty table. At each step either an empty plate is put down, an olive is put down on a plate, an olive is removed, an empty plate is removed, or the olives on two plates that both have olives on them are combined on one of the two plates, with the other plate removed. Plates are indistinguishable from one another, as are olives, and there is an inexhaustible supply of each.The game derives from the consideration of Morse functions on the 2-sphere. Specifically, the number of topological equivalence classes of excellent Morse functions on the 2-sphere that have order n (that is, that have 2n + 2 critical points) is the same as the number of ways of returning to an empty table for the first time after exactly 2n + 2 steps. We call this number M n .Nicolaescu gave the lower bound M n ≥ (2n − 1)!! = (2/e) n+o(n) n n and speculated that log M n ∼ n log n. In this note we confirm this speculation, showing that M n ≤ (4/e) n+o(n) n n .

A Random Variant of the Game of Plates and Olives

“…A lower bound for T 2 n was given by Nicolaescu in [7] by studying walks on Young's lattice. An upper bound on T 2 n was given by Carroll and Galvin in [1] from studying the game of plates and olives directly. The bounds of these two papers give (2/e) n+o(n) n n ≤ T 2 n ≤ (4/e) n+o(n) n n .…”