Surface-inversion correspondence for spherical parking functions and birooted trees
Statement
Let be a positive integer. A spherical parking function of length has a degree, and a birooted tree on vertex set has a number of surface inversions, where a surface inversion is a pair of non-root vertices such that is a descendant of and . Surface-inversion correspondence. The number of spherical parking functions of length of degree
is equal to the number of birooted trees on vertex set with surface inversions. This conjectural correspondence would connect the degree enumeration of spherical parking functions with an inversion statistic on birooted trees, analogous to the classical relationship between parking functions and spanning trees; the supplied text does not indicate whether it has been proved or remains open.
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.