fairfolio
Saved Projects

Vector Parking Functions and Tree Inversions

ISEF · 2015

Gaydarov, Petar

Overview

We find a depth-first search version of Dhar's burning algorithm that gives a bijection between the parking functions of a multigraph and its spanning trees. Thus we extend a result by Perkinson, Yang and Yu in response to a problem posed by Stanley. We also find another variant of this algorithm which gives a bijection between vector parking functions and labeled spanning trees closely related to the rooted planar trees. Both bijections have the goal of establishing a relation between the degree of a parking function, the ?-statistic for inversions, and the edge labelling of a tree. In addition, we find an intriguing formula for the number of vector parking functions in a special case of particular interest.

Awards (1)

  • American Mathematical Society: Second Award of $200 $200

Competition history

  • ISEF 2015 Category not listed · Entry MATH046I Affiliated fair in Bulgaria

Resources

Related projects

Closest projects by meaning, across every fair and year in the corpus.

Browse more like this

Source: Regeneron International Science and Engineering Fair

Save projects to your library

Sign in with Google to keep track of projects you find interesting, organized into folders. An account also raises your daily allowance for “Has this been done?”, and lets you create a key for the MCP server with a much higher limit than anonymous use. Browsing stays public.

Continue with Google