Zobrazeno 1 - 10
of 21
pro vyhledávání: '"knight's paths"'
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
Publikováno v:
Enumerative Combinatorics and Applications, Vol 5, Iss 1, p Article #S2R6 (2024)
Externí odkaz:
https://doaj.org/article/6e21802e12244e9d841a73ea24c7a852
Two algorithms for construction of all closed knight's paths of lengths up to 16 are presented. An approach for classification (up to equivalence) of all such paths is considered. By applying the construction algorithms and classification approach, w
Externí odkaz:
http://arxiv.org/abs/2304.00565
Autor:
Baril, Jean-Luc, Ramirez, José Luis
We provide enumerating results for partial knight's paths of a given size. We prove algebraically that zigzag knight's paths of a given size ending on the $x$-axis are enumerated by the generalized Catalan numbers, and we give a constructive bijectio
Externí odkaz:
http://arxiv.org/abs/2206.12087
Autor:
Baril, Jean-Luc, Ramírez, José L.
Publikováno v:
In Discrete Mathematics June 2023 346(6)
Autor:
Jean-Luc Baril, José L. Ramírez
Publikováno v:
Discrete Mathematics. 346:113372
Publikováno v:
Discussiones Mathematicae: Probability & Statistics. 2013, Vol. 33 Issue 1-2, p121-149. 29p. 8 Charts, 3 Graphs.
Publikováno v:
Set-Valued & Variational Analysis; Jun2018, Vol. 26 Issue 2, p277-304, 28p
Autor:
Escalante, R.G., Malki, H.A.
Publikováno v:
2006 IEEE International Joint Conference on Neural Network Proceedings; 2006, p1447-1450, 4p