Parking cars with spin but no length (Q1969284)

The car parking problem models the deposition of segments on a line without overlappings. The authors generalize the car parking problem by introducing two species of cars whose densities are \(p\) and \(q=1-p\). Cars of the same species are friendly in that they are allowed to park within a distance exceeding 1 while cars of the opposite species are unfriendly, viz. they should be separated by a distance \(a>1\) at least. The system eventually reaches the so-called jamming limit when no more cars can be parked. The jamming density \(\rho(p,a)\) exhibits a nontrivial dependence on \(p\) and \(a\): It is neither monotonic in \(p\) for a fixed \(a\), nor it is monotonic in \(a\) for fixed \(p\).