Zobrazeno 1 - 5
of 5
pro vyhledávání: '"Hassler, Nathanaël"'
Autor:
Baril, Jean-Luc, Hassler, Nathanaël
We focus on a family of subsets $(\F^p_n)_{p\geq 2}$ of Dyck paths of semilength $n$ that avoid the patterns $DUU$ and $D^{p+1}$, which are enumerated by the generalized Fibonacci numbers. We endow them with the partial order relation induced by the
Externí odkaz:
http://arxiv.org/abs/2411.17628
Publikováno v:
EPTCS 403, 2024, pp. 108-112
We investigate the existence of greedy Gray codes, based on the choice of the first element in the code, for two classes of binary words: generalized Fibonacci words and generalized Dyck words.
Comment: In Proceedings GASCom 2024, arXiv:2406.145
Comment: In Proceedings GASCom 2024, arXiv:2406.145
Externí odkaz:
http://arxiv.org/abs/2406.16405
We study the enumeration of different classes of grand knight's paths in the plane. In particular, we focus on the subsets of zigzag knight's paths that are subject to constraints. These constraints include ending at $y$-coordinate 0, bounded by a ho
Externí odkaz:
http://arxiv.org/abs/2402.04851
Autor:
Hassler, Nathanaël, Treglown, Andrew
Balogh, Liu, Sharifzadeh and Treglown [Journal of the European Mathematical Society, 2018] recently gave a sharp count on the number of maximal sum-free subsets of $\{1, \dots, n\}$, thereby answering a question of Cameron and Erd\H{o}s. In contrast,
Externí odkaz:
http://arxiv.org/abs/2108.04615
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.