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 .
Recommendations
- Parking functions and labeled trees
- Parking distributions on trees
- Parking functions on oriented trees
- Parking functions and tree inversions revisited
- Parking on supercritical Galton-Watson trees
- Prime parking functions on rooted trees
- Parking on a random rooted plane tree
- Parking functions and noncrossing partitions
- Parking function varieties for combinatorial tree models
Cites work
- An Occupancy Discipline and Applications
- Enumeration of noncrossing trees on a circle
- scientific article; zbMATH DE number 3149991 (Why is no real title available?)
- scientific article; zbMATH DE number 1889828 (Why is no real title available?)
- scientific article; zbMATH DE number 3340110 (Why is no real title available?)
- Parking functions and noncrossing partitions
- Planted Brussels Sprouts (after Ji-Propp)
Cited in
(6)
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)