English
Related papers

Related papers: Some enumerative properties of parking functions

200 papers

We introduce a new approach to the enumeration of rational slope parking functions with respect to the area and a generalized dinv statistics, and relate the combinatorics of parking functions to that of affine permutations. We relate our…

Combinatorics · Mathematics 2016-09-30 Eugene Gorsky , Mikhail Mazin , Monica Vazirani

This article proposes two different approaches to automatically create a map for valid on-street car parking spaces. For this, we use car sharing park-out events data. The first one uses spatial aggregation and the second a machine learning…

Machine Learning · Computer Science 2021-08-03 J. -Emeterio Navarro-B , Martin Gebert , Ralf Bielig

We consider the joint distribution of the area and perimeter statistics on the set I_n of inversion sequences of length n represented as bargraphs. Functional equations for both the ordinary and exponential generating functions are derived…

Combinatorics · Mathematics 2022-03-16 Toufik Mansour , Mark Shattuck

In a recent article a generalization of the binomial distribution associated with a sequence of positive numbers was examined. The analysis of the nonnegativeness of the formal expressions was a key-point to allow to give them a statistical…

Mathematical Physics · Physics 2015-06-04 H. Bergeron , E. M. F. Curado , J. P. Gazeau , Ligia M. C. S. Rodrigues

If the moments of a probability measure on $\R$ are interpreted as a specialization of complete homogeneous symmetric functions, its free cumulants are, up to sign, the corresponding specializations of a sequence of Schur positive symmetric…

Combinatorics · Mathematics 2007-05-23 Jean-Christophe Novelli , Jean-Yves Thibon

We study subadditive functions of the random parking model previously analyzed by the second author. In particular, we consider local functions $S$ of subsets of $\mathbb{R}^d$ and of point sets that are (almost) subadditive in their first…

Probability · Mathematics 2015-06-04 Antoine Gloria , Mathew D. Penrose

We find an explicit $S_n$-equivariant bijection between the integral points in a certain zonotope in $\mathbb{R}^n$, combinatorially equivalent to the permutahedron, and the set of $m$-parking functions of length $n$. This bijection…

Combinatorics · Mathematics 2026-02-19 Valery Lunts , Špela Špenko , Michel Van den Bergh

For $0\leq k\leq n-1$, we introduce a family of $k$-skeletal paths which are counted by the $n$-th Catalan number for each $k$, and specialize to Dyck paths when $k=n-1$. We similarly introduce $k$-skeletal parking functions which are…

We show that the notion of parkization of a word, a variant of the classical standardization, allows to introduce an internal product on the Hopf algebra of parking functions. Its Catalan subalgebra is stable under this operation and…

Combinatorics · Mathematics 2013-02-12 Jean-Christophe Novelli , Jean-Yves Thibon

We continue the study of parking assortments, a generalization of parking functions introduced by Chen, Harris, Mart\'{i}nez, Pab\'{o}n-Cancel, and Sargent. Given $n$ cars of lengths $\mathbf{y}=(y_1,y_2,\dots,y_n) \in \mathbb{N}^n$, we…

Combinatorics · Mathematics 2023-11-28 Douglas M. Chen

A special type of binomial splitting process is studied. Such a process can be used to model a high-dimensional corner parking problem, as well as the depth of random PATRICIA tries (a special class of digital tree data structures). The…

Probability · Mathematics 2013-11-27 Michael Fuchs , Hsien-Kuei Hwang , Yoshiaki Itoh , Hosam H. Mahmoud

Parking functions are well researched and interesting results are found in the listed references and more. Some introductory results stemming from application to degree sequences of simple connected graphs are provided in this paper.…

Combinatorics · Mathematics 2014-09-16 Johan Kok

The Catalan numbers constitute one of the most important sequences in combinatorics. Catalan objects have been generalized in various directions, including the classical Fuss-Catalan objects and the rational Catalan generalization of…

Combinatorics · Mathematics 2018-05-11 Cesar Ceballos , Rafael S. González D'León

We show that a minimal triangulation of the associahedron (Stasheff polytope) of dimension n is made of (n+1)^{n-1} simplices. We construct a natural bijection with the set of parking functions from a new interpretation of parking functions…

Algebraic Topology · Mathematics 2007-05-23 Jean-Louis Loday

We study three families of labelled plane trees. In all these trees, the root is labelled 0, and the labels of two adjacent nodes differ by $0, 1$ or -1. One part of the paper is devoted to enumerative results. For each family, and for all…

Combinatorics · Mathematics 2008-05-05 Mireille Bousquet-Mélou

In 1980, Edelman defined a poset on objects called the noncrossing 2-partitions. They are closely related with noncrossing partitions and parking functions. To some extent, his definition is a precursor of the parking space theory, in the…

Discrete Mathematics · Computer Science 2023-01-06 Bérénice Delcroix-Oger , Matthieu Josuat-Vergès , Lucas Randazzo

In this paper we develop a classification of real functions based on growth rates of repeated iteration. We show how functions are naturally distinguishable when considering inverses of repeated iterations. For example, $n+2\to 2n\to 2^n\to…

Classical Analysis and ODEs · Mathematics 2024-09-11 Titus Hilberdink

Parking plays a central role in transport policies and has wide-ranging consequences: While the average time spent searching for parking exceeds dozens of hours per driver every year in many Western cities, the associated cruising traffic…

Statistical Mechanics · Physics 2023-01-09 Nilankur Dutta , Thibault Charlottin , Alexandre Nicolas

We define a function by refining Stern's diatomic sequence. We name it the {\it assembly function}. It is strictly increasing continuous. The first and the second main theorems are on an action to the function. The third theorem is on…

Number Theory · Mathematics 2020-04-02 Yasuhisa Yamada

We consider the set of finite sequences of length n over a finite or countable alphabet C. We consider the function which associate each given sequence with the size of the maximum overlap with a (shifted) copy of itself. We compute the…

Probability · Mathematics 2011-10-28 Miguel Abadi , Rodrigo Lambert