7 citations · 9 across the 4 of their papers we have counts for
4 papers
Bijection: Parking-like structures and Tree-like structures
Jean-Baptiste Priez
We recall the occupancy problem introduced by Konheim & Weiss in 1966 and we consider parking functions as hash maps. Each car prefers parking space (the hash map $c_i…
Enumeration of minimal acyclic automata via generalized parking functions
Jean-Baptiste Priez
We give an exact enumerative formula for the minimal acyclic deterministic finite automata. This formula is obtained from a bijection between a family of generalized parking functi…
Non-commutative Frobenius characteristic of generalized parking functions -- Application to enumeration
Jean-Baptiste Priez, Aladin Virmaux
We give a recursive definition of generalized parking function that allows us to view them as a species. From there we compute a non-commutative characteristic of the generalized p…
A lattice of combinatorial Hopf algebras, Application to binary trees with multiplicities
Jean-Baptiste Priez
In a first part, we formalize the construction of combinatorial Hopf algebras from plactic-like monoids using polynomial realizations. Thank to this construction we reveal a lattic…