Zobrazeno 1 - 10
of 133
pro vyhledávání: '"Pinzani, Renzo"'
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
Each positive increasing integer sequence $\{a_n\}_{n\geq 0}$ can serve as a numeration system to represent each non-negative integer by means of suitable coefficient strings. We analyse the case of $k$-generalized Fibonacci sequences leading to the
Externí odkaz:
http://arxiv.org/abs/2204.10069
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
Since some years, non-overlapping sets of strings (also called cross-bifix-free sets) have had an increasing interest in the frame of the researches about Theory of Codes. Recently some non-overlapping sets of strings with variable length were introd
Externí odkaz:
http://arxiv.org/abs/2006.05878
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.
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
A bidimensional bifix (in short bibifix) of a square matrix T is a square submatrix of T which occurs in the top-left and bottom-right corners of T. This allows us to extend the definition of bifix-free words and cross-bifix-free set of words to bidi
Externí odkaz:
http://arxiv.org/abs/1502.05275
Cross-bifix-free sets are sets of words such that no prefix of any word is a sufix of any other word. In this paper, we introduce a general constructive method for the sets of cross-bifix-free q-ary words of fixed length. It enables us to determine a
Externí odkaz:
http://arxiv.org/abs/1410.4710