Brussels sprouts, noncrossing trees, and parking functions

From MaRDI portal
(Redirected from Publication:5093416)



Abstract: We consider a variant of the game of Brussels Sprouts that, like Conway's original version, ends in a predetermined number of moves. We show that the endstates of the game are in natural bijection with noncrossing trees and that the game histories are in natural bijection with both parking functions and factorizations of a cycle of Sn.












This page was built for publication: Brussels sprouts, noncrossing trees, and parking functions

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