Keith Copenhaver

activity

20162023

collaborators

3 papers

math.CO2023

A new lower bound for deterministic pop-stack-sorting

Morgan Bauer, Keith Copenhaver

The pop-stack-sorting process is a variation of the stack-sort process. We consider a deterministic version of this process, and provide a new lower bound of $\frac{3}{5} n$ for the…

math.CO2018

Lengths of paths in rooted trees

Keith Copenhaver

We provide formulas for generating functions of many types of paths in various rooted tree structures. We compute the $k$ th moment of the generating functions for various types of…

math.CO2016

$k$ -protected vertices in unlabeled rooted plane trees

Keith Copenhaver

We find a simple, closed formula for the proportion of vertices which are $k$ -protected in all unlabeled rooted plane trees on $n$ vertices. We also find that, as $n$ goes to infin…

A new lower bound for deterministic pop-stack-sorting

Lengths of paths in rooted trees

k-protected vertices in unlabeled rooted plane trees

$k$ -protected vertices in unlabeled rooted plane trees