A note on the log-concavity of parking functions
Combinatorics
2024-12-30 v1
Abstract
We settle a conjecture of B\'ona regarding the log-concavity of a certain statistic on parking functions by utilizing recent log-concavity results on matroids. This result allows us to also prove that connected, labeled graphs graded by their number of edges are log-concave. Furthermore, we generalize these results to -parking functions.
Keywords
Cite
@article{arxiv.2412.19783,
title = {A note on the log-concavity of parking functions},
author = {Joseph Pappe},
journal= {arXiv preprint arXiv:2412.19783},
year = {2024}
}