Zobrazeno 1 - 10
of 44
pro vyhledávání: '"Villamizar, Diego"'
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
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
Autor:
Astaiza, Weymar, Barrios, Alexander J., Chimal-Dzul, Henry, Garcia, Stephan Ramon, de la Luz, Jaaziel, Moll, Victor H., Puig, Yunied, Villamizar, Diego
The symmetric tensor power of graphs is introduced and its fundamental properties are explored. A wide range of intriguing phenomena occur when one considers symmetric tensor powers of familiar graphs. A host of open questions are presented, hoping t
Externí odkaz:
http://arxiv.org/abs/2309.13741
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
Publikováno v:
In Journal of Combinatorial Theory, Series A November 2024 208
In this paper, we consider a generalization of the Stirling number sequence of both kinds by using a specialization of a new family of symmetric functions. We give combinatorial interpretations for this symmetric functions by means of weighted lattic
Externí odkaz:
http://arxiv.org/abs/2110.10591
In this paper we study a subfamily of a classic lattice path, the \emph{Dyck paths}, called \emph{restricted $d$-Dyck} paths, in short $d$-Dyck. A valley of a Dyck path $P$ is a local minimum of $P$; if the difference between the heights of two conse
Externí odkaz:
http://arxiv.org/abs/2108.08299
Extensions of a set partition obtained by imposing bounds on the size of the parts and the coloring of some of the elements are examined. Combinatorial properties and the generating functions of some counting sequences associated with these partition
Externí odkaz:
http://arxiv.org/abs/2103.04151
The divisor function $\sigma(n)$ denotes the sum of the divisors of the positive integer $n$. For a prime $p$ and $m \in \mathbb{N}$, the $p$-adic valuation of $m$ is the highest power of $p$ which divides $m$. Formulas for $\nu_{p}(\sigma(n))$ are e
Externí odkaz:
http://arxiv.org/abs/2007.03088
Set partitions and permutations with restrictions on the size of the blocks and cycles are important combinatorial sequences. Counting these objects lead to the sequences generalizing the classical Stirling and Bell numbers. The main focus of the pre
Externí odkaz:
http://arxiv.org/abs/1707.08138