Zobrazeno 1 - 10
of 93
pro vyhledávání: '"Bilotta, Stefano"'
Given a positive rational $q$, we consider Dyck paths having height at most two with some constraints on the number of consecutive peaks and consecutive valleys, depending on $q$. We introduce a general class of Dyck paths, called rational Dyck paths
Externí odkaz:
http://arxiv.org/abs/2409.20210
Publikováno v:
EPTCS 403, 2024, pp. 49-53
We consider Dyck paths having height at most two with some constraints on the number of consecutive valleys at height one which must be followed by a suitable number of valleys at height zero. We prove that they are enumerated by so-called Q-bonacci
Externí odkaz:
http://arxiv.org/abs/2406.16394
Dyck paths having height at most $h$ and without valleys at height $h-1$ are combinatorially interpreted by means of 312-avoding permutations with some restrictions on their \emph{left-to-right maxima}. The results are obtained by analyzing a restric
Externí odkaz:
http://arxiv.org/abs/2307.02837
Publikováno v:
EPTCS 386, 2023, pp. 25-34
We propose a method for the construction of sets of variable dimension strong non-overlapping matrices basing on any strong non-overlapping set of strings.
Comment: In Proceedings AFL 2023, arXiv:2309.01126
Comment: In Proceedings AFL 2023, arXiv:2309.01126
Externí odkaz:
http://arxiv.org/abs/2204.09365
Autor:
Bellini, Pierfrancesco1 (AUTHOR) pierfrancesco.bellini@unifi.it, Bilotta, Stefano1 (AUTHOR), Collini, Enrico1 (AUTHOR), Fanfani, Marco1 (AUTHOR), Nesi, Paolo1 (AUTHOR) paolo.nesi@unifi.it
Publikováno v:
Sensors (14248220). Jan2024, Vol. 24 Issue 2, p441. 22p.
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
We define a set of binary matrices where any two of them can not be placed one on the other in a way such that the corresponding entries coincide. The rows of the matrices are obtained by means of Dyck words. The cardinality of the set of such matric
Externí odkaz:
http://arxiv.org/abs/1811.10918
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
Bilotta, Stefano
We define a variable-length code having the property that no (non-empty) prefix of each its codeword is a suffix of any other one, and vice versa. This kind of code can be seen as an extension of two well-known codes in literature, called respectivel
Externí odkaz:
http://arxiv.org/abs/1605.03785
Two matrices are said non-overlapping if one of them can not be put on the other one in a way such that the corresponding entries coincide. We provide a set of non-overlapping binary matrices and a formula to enumerate it which involves the $k$-gener
Externí odkaz:
http://arxiv.org/abs/1601.07723