Ties on ParkingFunction

Positions i with p(i) = p(i+1).

On ParkingFunction

FindStat's St001947.

Called as CombinatorialStat(x, "Ties"). The head's page has its examples.

Live

Distribution

Over ParkingFunctions at each size, tallied here in your browser; sizes past 6 are not offered.

Sizes 1 to

FindStat St001947

The number of ties in a parking function.

The number of ties in a parking function. This is the number of indices $i$ such that $p_i=p_{i+1}$.

Object	Value
[1]	0
[1,1]	1
[1,2]	0
[2,1]	0
[1,1,1]	2
[1,1,2]	1
[1,1,3]	1
[1,2,1]	0

Data from FindStat, the combinatorial statistic finder; the page at findstat.org/St001947 has the rest.