A Parking Functions is a combinatorial structure in algebraic and enumerative combinatorics that consists of a sequence of positive integers of length \( n \) such that, when sorted in non-decreasing order, each term is at most its position index, thereby encoding a discrete allocation problem equivalent to the successful parking of \( n \) cars on \( n \) preferred spots under a linear preference rule.
48
Publications
1.7K
Citations
75
Authors
64
Institutions
Publications per year
2017–2026
5
Publications
48
1–5 of 48
Authors
75
- JNJean-Christophe Novelli
Laboratoire d'Informatique Gaspard-Monge, France
5 publications · 159 citations
5
h-index
- CH
5
h-index
- JT
5
h-index
- DA
4
h-index
- DP
3
h-index
1–5 of 75
Institutions
64
Massachusetts Institute of Technology
Cambridge, United States
5 h-index
6 publications
474 citations
Laboratoire d'Informatique Gaspard-Monge
Champs-sur-Marne, France
4 h-index
8 publications
274 citations
Texas A&M University
College Station, United States
4 h-index
4 publications
153 citations
University of Miami
Coral Gables, United States
3 h-index
3 publications
101 citations
Reed College
Portland, United States
3 h-index
6 publications
102 citations
University of North Texas
Denton, United States
3 h-index
3 publications
85 citations
University of Kentucky
Lexington, United States
3 h-index
4 publications
61 citations
Queen Mary University of London
London, United Kingdom
3 h-index
3 publications
49 citations
1–8 of 64
Venues
- The Electronic Journal of Combinatorics
7 publications · 271 citations
7
h-index
- Journal of Combinatorial Theory Series A
6 publications · 199 citations
6
h-index
- Discrete Mathematics
5 publications · 112 citations
5
h-index
- Transactions of the American Mathematical Society
TRAN · 4 publications · 59 citations
4
h-index
- Advances in Applied Mathematics
4 publications · 113 citations
4
h-index
1–5