Rényi's parking constants are the limiting mean and variance per unit length in the following random parking
process. For the closed interval with
, one-dimensional "cars" of unit length attempt
to park sequentially, with their left endpoints chosen independently and uniformly
from
.
An attempt is rejected if it overlaps a parked car, but endpoint touching is allowed.
Parking continues until the probability of another
successful attempt is zero. Let
be the terminal number of parked cars. With the convention
,
its mean
satisfies
|
(1)
|
The mean density of the cars for large is
|
(2)
| |||
|
(3)
| |||
|
(4)
|
(OEIS A050996). While the inner integral can be done analytically,
|
(5)
| |||
|
(6)
|
for ,
where
is the Euler-Mascheroni constant and
is the incomplete gamma function, it
is not known how to do the outer one
|
(7)
| |||
|
(8)
| |||
|
(9)
|
where
is the exponential integral. The slowly converging
series expansion for the integrand is given by
|
(10)
|
In addition,
|
(11)
|
as
for every positive integer
(Rényi 1958), which was strengthened by Dvoretzky and
Robbins (1964) to
|
(12)
|
Dvoretzky and Robbins (1964) also proved that
|
(13)
|
for .
Let
be the variance of
. Dvoretzky and Robbins (1964) and Mannion (1964) showed
that
|
(14)
| ||||
|
(15)
| ||||
|
(16)
|
(OEIS A086245), where is a second moment
and
|
(17)
| |||
|
(18)
|
and the numerical value is due to Blaisdell and Solomon (1970). Dvoretzky and Robbins (1964) also proved that
|
(19)
|
For the discrete parking problem, cars occupy consecutive sites of an initially empty finite cyclic lattice.
Each car is placed at a uniformly chosen available position until none remain. For
an integer
, the limiting mean fraction
of vacant sites as the lattice size tends to infinity is
|
(20)
|
where
is a harmonic number (Finch 2003, p. 281;
Tsvetkov 2020). In particular,
|
(21)
| |||
|
(22)
| |||
|
(23)
|
where
is the imaginary error function.
Palasti (1960) conjectured that for sequential random parking of parallel unit squares in an by
rectangle, with
denoting the mean terminal number
of squares,
|
(24)
|
but this has not yet been proven or disproven (Finch 2003).