Zobrazeno 1 - 5
of 5
pro vyhledávání: '"Verciani, Francesco"'
Autor:
Ferrari, Luca, Verciani, Francesco
Naples parking functions were introduced as a generalization of classical parking functions, in which cars are allowed to park backwards, by checking up to a fixed number of previous slots, before proceedings forward as usual. In our previous work (a
Externí odkaz:
http://arxiv.org/abs/2411.06876
The associahedron is the graph $\mathcal{G}_N$ that has as nodes all triangulations of a convex $N$-gon, and an edge between any two triangulations that differ in a flip operation. A flip removes an edge shared by two triangles and replaces it by the
Externí odkaz:
http://arxiv.org/abs/2406.03783
Autor:
Ferrari, Luca, Verciani, Francesco
Naples parking functions were introduced as a generalization of classical parking functions, in which cars are allowed to park backwards, by checking up to a fixed number of previous spots, before proceeding forward as usual. In this work we introduc
Externí odkaz:
http://arxiv.org/abs/2405.07522
Fay, Hurlbert and Tennant recently introduced a one-player game on a finite connected graph $G$, which they called cup stacking. Stacks of cups are placed at the vertices of $G$, and are transferred between vertices via stacking moves, subject to cer
Externí odkaz:
http://arxiv.org/abs/2401.06189
Autor:
Verciani, Francesco
We propose a characterization of $k$-Naples parking functions in terms of subsequences with the structure of a complete $k$-Naples parking function. We define complete parking preferences by requiring that for all $j=2,\dots,n$, the number of cars ha
Externí odkaz:
http://arxiv.org/abs/2311.03549