scholarly journals Parking Functions, Stack-Sortable Permutations, and Spaces of Paths in the Johnson Graph

10.37236/1683 ◽  
2003 ◽  
Vol 9 (2) ◽  
Author(s):  
Catalin Zara

We prove that the space of possible final configurations for a parking problem is parameterized by the vertices of a regular Bruhat graph associated to a 231-avoiding permutation, and we show how this relates to parameterizing certain spaces of paths in the Johnson graph.

2014 ◽  
Vol 556-562 ◽  
pp. 2540-2543
Author(s):  
Hai Yan Yang

As the car quantity increasing, solve the parking problem is becoming more and more serious, but due to the shortage of land resources in the big city, establish a way of parking which occupies less land is imminent, Three-dimensional garage arises at the historic moment. The design introduced a three-dimensional garage with PLC control; it can realize multi-layer storage of the vehicle, and conform to the requirements of Times.


1980 ◽  
Vol 85 (1) ◽  
pp. 129-136 ◽  
Author(s):  
C. P. ELLINGTON

1. All of the wing fringe cilia of Thrips physapus, except those along the hindwing leading edge, pivot in elongated sockets which lock them into two positions. 2. The wings lie parallel over the abdomen when not in use, with the cilia locked in the closed position at an angle of 15-20° to the wing axis. The closing of the fringes prevents entanglement of the trailing edge cilia and lateral projection of the forewing leading edge cilia. 3. During flight the cilia are locked in the open position, doubling the wing area. The locking force is stronger than the combined aerodynamic and inertial forces on the cilia. 4. The fringes are opened by abdominal combing and closed by tibial combing. 5. The same morphological features are found in other members of the sub-order Terebrantia. Parallel wings at rest are characteristic of this suborder, and the collapsible fringe system is viewed as an effective method for parking the wings. 6. The fringes of the sub-order Tubulifera are not collapsible. The wings overlap on the abdomen at rest and a similar parking problem does not arise.


2012 ◽  
Vol 193-194 ◽  
pp. 1075-1078
Author(s):  
Xue Ying Wang ◽  
Chun Xiang Liu ◽  
Dong Xu

Currently, small car quantity of residents in the our country city is raise year by year.The parking problem of in each city's living area is outstanding day by day. Aimming at the difficult problem of parking the car, The paper analysis the reason for producing it, probes the countermeasures and solutions to the parking problems in residential areas from two aspects of parking index and the way of parking facilities.


10.37236/2684 ◽  
2012 ◽  
Vol 19 (4) ◽  
Author(s):  
Sam Hopkins ◽  
David Perkinson

It is known that the Pak-Stanley labeling of the Shi hyperplane arrangement provides a bijection between the regions of the arrangement and parking functions. For any graph $G$, we define the $G$-semiorder arrangement and show that the Pak-Stanley labeling of its regions produces all $G$-parking functions.


2019 ◽  
Vol 8 (2S11) ◽  
pp. 3531-3534

In this busy world, people are tending towards automation in all routine works which in turn is saving their time. Due to the increased use of cars and congesting places, everywhere we are facing a queue to pass through. One such queue we face is in the parallel parking lots. For solving this problem, many automobile manufacturers have come up with Auto Parking Features in New Model Cars. Then what about Old Cars? Shouldn’t those Old Cars get modified with this Auto Parking facility? Yes, they can get modified with our proposed solution. In this paper, we are presenting a solution in the form of a module for the parallel parking problem called “Automatic Parallel Car Parking System – using Sensors and Arduino UNO”. Along with New Cars, this module can also be integrated with Old Electric Cars to bring Auto Parallel Park feature. This paper also discusses existing Auto Parallel Parking Systems. It also discusses the proposed solution by solving the flaws in existing solutions. The proposed solution is easily adaptable, with small modifications to an electric car. Future enhancements are also proposed.


10.37236/5940 ◽  
2016 ◽  
Vol 23 (3) ◽  
Author(s):  
Melody Bruce ◽  
Michael Dougherty ◽  
Max Hlavacek ◽  
Ryo Kudo ◽  
Ian Nicolas

There is a well-known bijection between parking functions of a fixed length and maximal chains of the noncrossing partition lattice which we can use to associate to each set of parking functions a poset whose Hasse diagram is the union of the corresponding maximal chains. We introduce a decomposition of parking functions based on the largest number omitted and prove several theorems about the corresponding posets. In particular, they share properties with the noncrossing partition lattice such as local self-duality, a nice characterization of intervals, a readily computable Möbius function, and a symmetric chain decomposition. We also explore connections with order complexes, labeled Dyck paths, and rooted forests.


2007 ◽  
Vol 193 (3) ◽  
pp. 189-241 ◽  
Author(s):  
Jean-Christophe Novelli ◽  
Jean-Yves Thibon

Sign in / Sign up

Export Citation Format

Share Document