The game of plates and olives

From MaRDI portal
Publication:668071

zbMATH Open1409.05021arXiv1711.10670MaRDI QIDQ668071FDOQ668071


Authors: Teena Carroll, David Galvin Edit this on Wikidata


Publication date: 5 March 2019

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

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 Mn. Nicolaescu gave the lower bound Mngeq(2n1)!!=(2/e)n+o(n)nn and speculated that logMnsimnlogn. In this note we confirm this speculation, showing that Mnleq(4/e)n+o(n)nn.


Full work available at URL: https://arxiv.org/abs/1711.10670

File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)



Recommendations



Cites Work


Cited In (1)





This page was built for publication: The game of plates and olives

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q668071)