Results 31 to 40 of about 2,802,612 (287)

Non-commutative Frobenius characteristic of generalized parking functions : Application to enumeration [PDF]

open access: yesDiscrete 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

Parking functions and generalizations [PDF]

open access: yes, 2009
Betrachte eine Einbahnstraße mit n nummerierten Parkplätzen in einer Reihe.m aufeinanderfolgende Fahrer wollen in dieser Straße parken, wobei jeder einen bevorzugten Parkplatz hat. Jeder Fahrer fährt zu der gewählten Stelle und parkt dort, falls sie frei
Seitz, Georg
core   +4 more sources

Abel-Gontcharoff polynomials, parking trajectories and ruin probabilities

open access: yesDependence 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

On Parking Functions and The Tower of Hanoi

open access: yesThe 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   +3 more sources

Type C parking functions and a zeta map [PDF]

open access: yesDiscrete 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

A Multi-View Approach for Regional Parking Occupancy Prediction with Attention Mechanisms

open access: yesMathematics, 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

Some Properties of the Parking Function Poset

open access: yesThe 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

Function Replacement Decision-Making for Parking Space Renewal Based on Association Rules Mining

open access: yesLand, 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

Parking Functions and Noncrossing Partitions [PDF]

open access: yesThe Electronic Journal of Combinatorics, 1996
A parking function is a sequence $(a_1,\dots,a_n)$ of positive integers such that, if $b_1\leq b_2\leq \cdots\leq b_n$ is the increasing rearrangement of the sequence $(a_1,\dots, a_n),$ then $b_i\leq i$. A noncrossing partition of the set $[n]=\{1,2,\dots,n\}$ is a partition $\pi$ of the set $[n]$ with the property that if $a < b < c < d ...
openaire   +3 more sources

Bigraphical arrangements [PDF]

open access: yesDiscrete Mathematics & Theoretical Computer Science, 2014
We define the bigraphical arrangement of a graph and show that the Pak-Stanley labels of its regions are the parking functions of a closely related graph, thus proving conjectures of Duval, Klivans, and Martin and of Hopkins and Perkinson.
Sam Hopkins, David Perkinson
doaj   +1 more source

Home - About - Disclaimer - Privacy