Zobrazeno 1 - 10
of 3 499
pro vyhledávání: '"Ramirez, Jose"'
Autor:
Bacon, Michael R., Cook, Charles K., Flórez, Rigoberto, Higuita, Robinson A., Ramírez, José L.
Inspired by the ancient spiral constructed by the greek philosopher Theodorus which is based on concatenated right triangles, we have created a spiral. In this spiral, called \emph{Fibonacci--Theodorus}, the sides of the triangles have lengths corres
Externí odkaz:
http://arxiv.org/abs/2407.07109
Autor:
Ramírez, José L., Villamizar, Diego
Publikováno v:
EPTCS 403, 2024, pp. 164-168
In this paper, we explore some generalizations of a counting problem related to tilings in grids of size 2xn, which was originally posed as a question on Mathematics Stack Exchange (Question 3972905). In particular, we consider this problem for the p
Externí odkaz:
http://arxiv.org/abs/2406.16415
In this work, we define flattened Catalan words as Catalan words whose runs of weak ascents have leading terms that appear in weakly increasing order. We provide generating functions, formulas, and asymptotic expressions for the number of flattened C
Externí odkaz:
http://arxiv.org/abs/2405.05357
We provide generating functions, formulas, and asymptotic expressions for the number of Catalan words based on the number of runs of ascents (descents), runs of weak ascents (descents), $\ell$-valleys, valleys, symmetric valleys, $\ell$-peaks, peaks,
Externí odkaz:
http://arxiv.org/abs/2404.05672
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 subject to constraints. These constraints include ending at ordinate 0, bounded by a horizontal line,
Externí odkaz:
http://arxiv.org/abs/2402.04851
A word $w=w_1\cdots w_n$ over the set of positive integers is a Motzkin word whenever $w_1=\texttt{1}$, $1\leq w_k\leq w_{k-1}+1$, and $w_{k-1}\neq w_{k}$ for $k=2, \dots, n$. It can be associated to a $n$-column Motzkin polyomino whose $i$-th column
Externí odkaz:
http://arxiv.org/abs/2401.06228
In this paper, we study pattern avoidance in weak ascent sequences, giving some results for patterns of length 3. This is an analogous study to one given by Duncan and Steingr\'imsson (2011) for ascent sequences. More precisely, we provide systematic
Externí odkaz:
http://arxiv.org/abs/2309.06518
A \emph{Dyck path} is a lattice path in the first quadrant of the $xy$-plane that starts at the origin, ends on the $x$-axis, and consists of the same number of North-East steps $U$ and South-East steps $D$. A \emph{valley} is a subpath of the form $
Externí odkaz:
http://arxiv.org/abs/2308.02059