Zobrazeno 1 - 10
of 1 028
pro vyhledávání: '"Ferrari, Luca"'
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
Publikováno v:
EPTCS 403, 2024, pp. 73-78
We consider sorting procedures for permutations making use of pop stacks with a bypass operation, and explore the combinatorial properties of the associated algorithms.
Comment: In Proceedings GASCom 2024, arXiv:2406.14588
Comment: In Proceedings GASCom 2024, arXiv:2406.14588
Externí odkaz:
http://arxiv.org/abs/2406.16399
Autor:
Brlek, Srečko, Ferrari, Luca
Publikováno v:
EPTCS 403, 2024
The conference GASCom brings together researchers in combinatorics, algorithms, probabilities, and more generally mathematical computer science, around the theme of random and exhaustive generation of combinatorial structures, mostly considered from
Externí odkaz:
http://arxiv.org/abs/2406.14588
We define a partial order $\mathcal{P}_n$ on permutations of any given size $n$, which is the image of a natural partial order on inversion sequences. We call this the ``middle order''. We demonstrate that the poset $\mathcal{P}_n$ refines the weak o
Externí odkaz:
http://arxiv.org/abs/2405.08943
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
Autor:
Ferrari, Luca <1980>
This dissertation aims to explore, from a pedagogical point of view and according to a “qualitative approach”, the issue of sustainable implementation of new technologies at school. Take in account the exploratory researches undertaken in Italy (
Externí odkaz:
http://amsdottorato.unibo.it/7437/
We study preimages of permutations under the bubblesort operator $\mathbf{B}$. We achieve a description of these preimages much more complete than what is known for the more complicated sorting operators $\mathbf{S}$ (stacksort) and $\mathbf{Q}$ (que
Externí odkaz:
http://arxiv.org/abs/2204.12936
Autor:
Ferrari, Luca <1985>
A permutation is said to avoid a pattern if it does not contain any subsequence which is order-isomorphic to it. Donald Knuth, in the first volume of his celebrated book "The art of Computer Programming", observed that the permutations that can be co
Externí odkaz:
http://amsdottorato.unibo.it/6032/