ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let nn be a positive integer. A spherical parking function of length nn has a degree, and a birooted tree on vertex set [n][n] has a number of surface inversions, where a surface inversion is a pair of non-root vertices (α,β)(\alpha,\beta) such that β\beta is a descendant of α\alpha and α>β\alpha>\beta. Surface-inversion correspondence. The number of spherical parking functions of length nn of degree

(n2)−k+1{n \choose 2}-k+1

is equal to the number of birooted trees on vertex set [n][n] with kk 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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.