Results 31 to 40 of about 7,280 (257)
From G-parking functions to B-parking functions [PDF]
Journal of Combinatorial Theory, Series A, 2018 A matching $M$ in a multigraph $G=(V,E)$ is said to be uniquely restricted if $M$ is the only perfect matching in the subgraph of $G$ induced by $V(M)$ (i.e., the set of vertices saturated by $M$). For any fixed vertex $x_0$ in $G$, there is a bijection from the set of spanning trees of $G$ to the set of uniquely restricted matchings of size $|V|-1$ in
openaire +2 more sources
Non-commutative Frobenius characteristic of generalized parking functions : Application to enumeration [PDF]
Discrete Mathematics & Theoretical Computer Science, 2015 We give a recursive definition of generalized parking functions that allows them to be viewed as a species. From there we compute a non-commutative characteristic of the generalized parking function module and deduce some enumeration formulas of ...
Jean-Baptiste Priez, Aladin Virmaux
doaj +1 more source
Abel-Gontcharoff polynomials, parking trajectories and ruin probabilities
Dependence Modeling, 2023 The central mathematical tool discussed is a non-standard family of polynomials, univariate and bivariate, called Abel-Goncharoff polynomials. First, we briefly summarize the main properties of this family of polynomials obtained in the previous work ...
Lefèvre Claude, Picard Philippe
doaj +1 more source
Type C parking functions and a zeta map [PDF]
Discrete Mathematics & Theoretical Computer Science, 2015 We introduce type $C$ parking functions, encoded as vertically labelled lattice paths and endowed with a statistic dinv'. We define a bijection from type $C$ parking functions to regions of the Shi arrangement of type $C$, encoded as diagonally labelled ...
Robin Sulzgruber, Marko Thiel
doaj +1 more source
On Parking Functions and The Tower of Hanoi
The American Mathematical Monthly, 2023 The displacement of a parking function measures the total difference between where cars want to park and where they ultimately park. In this article, we prove that the set of parking functions of length $n$ with displacement one is in bijection with the set of ideal states in the famous Tower of Hanoi game with $n+1$ disks and $n+1$ pegs, both sets ...
Yasmin Aguillon +8 more
openaire +2 more sources
A Multi-View Approach for Regional Parking Occupancy Prediction with Attention Mechanisms
Mathematics, 2023 The near-future parking space availability is informative for the formulation of parking-related policy in urban areas. Plenty of studies have contributed to the spatial–temporal prediction for parking occupancy by considering the adjacency between ...
Wei Ye +3 more
doaj +1 more source
Function Replacement Decision-Making for Parking Space Renewal Based on Association Rules Mining
Land, 2022 Parking lots are typical urban spaces with a large total area and scattered distribution. With the development of smart cars and shared driving, parking demand is likely to decline.
Bing Xia, Yichen Ruan
doaj +1 more source
Some Properties of the Parking Function Poset
The Electronic Journal of Combinatorics, 2022 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 framework of finite reflection groups. We present some enumerative and topological properties of this poset.
Delcroix-Oger, Bérénice +2 more
openaire +4 more sources
Rekayasa Tempat Parkir Kendaraan Mobil Berbasis Teknologi Informasi
Protek: Jurnal Ilmiah Teknik Elektro, 2022 The availability of parking lots is a must for perkatoran, shopping centers (malls), universities and others. Along with the ability of the public to have vehicles, both two-wheeled and four-wheeled vehicles, it makes parking spaces difficult and takes ...
Husain Husain +5 more
doaj +1 more source
Parking Functions of Types A and B [PDF]
The Electronic Journal of Combinatorics, 2001 The lattice of noncrossing partitions can be embedded into the Cayley graph of the symmetric group. This allows us to rederive connections between noncrossing partitions and parking functions. We use an analogous embedding for type B non-crossing partitions in order to answer a question raised by R.
openaire +2 more sources