Results 21 to 30 of about 297,062 (318)
Partial parking functions [PDF]
Discrete Mathematics, 2019 11 pages.
Rui Duarte, António Guedes de Oliveira
openaire +4 more sources
A further correspondence between $(bc,\bar{b})$-parking functions and $(bc,\bar{b})$-forests [PDF]
Annals of Combinatorics, 2009 AbstractA classical parking function of length n is a list of positive integers $$(a_1, a_2, \ldots , a_n)$$ ( a 1 , a 2
Heesung Shin, Jiang Zeng
openalex +4 more sources
Vector parking functions with periodic boundaries and rational parking functions
Journal of Combinatorial Theory, Series A, 2020 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Yue Cai, Catherine H. Yan
openaire +2 more sources
The Number of Prime Parking Functions
The Mathematical Intelligencer, 2023 A parking function of length $n$ is prime if we obtain a parking function of length $n-1$ by deleting one 1 from it. In this note we give a new direct proof that the number of prime parking functions of length $n$ is $(n-1)^{n-1}$. This proof leads to a new interpretation, in close terms to the definition of parking function.
Duarte, Rui +1 more
openaire +3 more sources
A Balanced Algorithm for In-City Parking Allocation: A Case Study of Al Madinah City
Sensors, 2021 Parking in heavily populated areas has been considered one of the main challenges in the transportation systems for the past two decades given the limited parking resources, especially in city centres. Drivers often waste long periods of time hunting for
Mohammad A. R. Abdeen +2 more
doaj +1 more source
Probabilizing parking functions
Advances in Applied Mathematics, 2017 We explore the link between combinatorics and probability generated by the question "What does a random parking function look like?" This gives rise to novel probabilistic interpretations of some elegant, known generating functions. It leads to new combinatorics: how many parking functions begin with $i$?
Persi Diaconis, Angela Hicks
openaire +2 more sources
Counting Defective Parking Functions [PDF]
The Electronic Journal of Combinatorics, 2008 Suppose that $m$ drivers each choose a preferred parking space in a linear car park with $n$ spaces. Each driver goes to the chosen space and parks there if it is free, and otherwise takes the first available space with a larger number (if any). If all drivers park successfully, the sequence of choices is called a parking function.
Cameron, P. +3 more
openaire +5 more sources
Standard fillings to parking functions [PDF]
Discrete Mathematics & Theoretical Computer Science, 2012 The Hilbert series of the Garsia-Haiman module can be written as a generating function of standard fillings of Ferrers diagrams. It is conjectured by Haglund and Loehr that the Hilbert series of the diagonal harmonics can be written as a generating ...
Elizabeth Niese
doaj +1 more source
The Stability of downtown parking and traffic congestion [PDF]
, 2008 In classical traffic flow theory, there are two velocities associated with a given level of traffic flow. Following Vickrey, economists have termed travel at the higher speed congested travel and at the lower speed hypercongested travel.
Arnott, Richard, İnci, Eren, Inci, Eren
core +13 more sources
From G-parking functions to B-parking functions [PDF]
Journal of Combinatorial Theory, Series A, 2018 A matching $M$ in a multigraph $G=(V,E)$ is said to be uniquely restricted if $M$ is the only perfect matching in the subgraph of $G$ induced by $V(M)$ (i.e., the set of vertices saturated by $M$). For any fixed vertex $x_0$ in $G$, there is a bijection from the set of spanning trees of $G$ to the set of uniquely restricted matchings of size $|V|-1$ in
openaire +2 more sources