Related papers: On Enumeration of Dyck Paths with colored hills

To a finite, connected, unoriented graph of Betti-number g>=2 and valencies >=3 we associate a finitely summable, commutative spectral triple (in the sense of Connes), whose induced zeta functions encode the graph. This gives another…

We introduce a class of $f(t)$-factorials, or $f(t)$-Pochhammer symbols, that includes many, if not most, well-known factorial and multiple factorial function variants as special cases. We consider the combinatorial properties of the…

We study the combinatorial properties of final types, which are certain non-decreasing sequences of integers, together with the partitions naturally associated with them. As a consequence, we obtain an identity expressing the $n$-nacci…

We consider the problem of counting subset of Dyck paths contained in a Ferrers diagram. This enumeration concerns to find the number of the elements in a branch of the Kr\'ew\'eras tree. Using the Ferrers diagrams associated with Dyck…

The higher $q,t$-Catalan polynomial $C^{(m)}_n(q,t)$ can be defined combinatorially as a weighted sum of lattice paths contained in certain triangles, or algebraically as a complicated sum of rational functions indexed by partitions of $n$.…

The Catalan numbers constitute one of the most important sequences in combinatorics. Catalan objects have been generalized in various directions, including the classical Fuss-Catalan objects and the rational Catalan generalization of…

Working with generating functions, the combinatorics of a recurrence relation can be expressed in a way that allows for more efficient calculation of the quantity. This is true of the Catalan numbers for an ordered binary tree…

We investigate compositions of a positive integer with a fixed number of parts, when there are several types of each natural number. These compositions produce new relationships among binomial coefficients, Catalan numbers, and numbers of…

Multiple analogues of certain families of combinatorial numbers are recently constructed by the author in terms of well poised Macdonald functions, and some of their fundamental properties are developed. In this paper, we present…

We study the exact extremal orders of compositions $f(g(n))$ of certain arithmetical functions, including the functions $\sigma(n)$, $\phi(n)$, $\sigma^*(n)$ and $\phi^*(n)$, representing the sum of divisors of $n$, Euler's function and…

Dyck paths are among the most heavily studied Catalan families. We work with peaks and valleys to uniquely decompose Dyck paths into the simplest objects - prime fragments with a single peak. Each Dyck path is uniquely characterized by a…

A function $\mathfrak{F}$ with simple and nice algebraic properties is defined on a subset of the space of complex sequences. Some special functions are expressible in terms of $\mathfrak{F}$, first of all the Bessel functions of first…

In this note, we characterize all functions $f : \mathbb{N} \rightarrow \mathbb{C}$ such that $f(x_1^2+ \cdots + x_k^2)=f(x_1)^2+ \cdots + f(x_k)^2$, where $k \geq 3$ and $x_1, \cdots, x_k$ are positive integers.

Let $G_{1}$ and $G_{2}$ be disjoint copies of a graph $G$, and let $g:V(G_{1})\rightarrow V(G_{2})$ be a function. A functigraph $F_{G}$ consists of the vertex set $V(G_{1})\cup V(G_{2})$ and the edge set $E(G_{1})\cup E(G_{2})\cup…

For each $p>0$ we define by recurrence a triangle $T^p(n,k)$ whose rows sum to the Fuss-Catalan numbers $ \frac{1}{p n+1}\binom{pn+1}{n}$, generalizing the known Catalan triangle corresponding to the case $p=2$. (In fact, $T^p(n,k)$ has an…

We considered the properties of generalized Fibonacci and Lucas numbers class. The analogues of well-known Fibonacci identities for generalized numbers are obtained. We gained a new identity of product convolution of generalized Fibonacci…

The set of Dyck paths of length $2n$ inherits a lattice structure from a bijection with the set of noncrossing partitions with the usual partial order. In this paper, we study the joint distribution of two statistics for Dyck paths:…

Fix $k \ge 3$. If a multiplicative function $f$ satisfies \[ f(x_1+x_2+\dots+x_k) = f(x_1) + f(x_2) + \dots + f(x_k) \] for arbitrary positive triangular numbers $x_1, x_2, \dots, x_k$, then $f$ is the identity function. This extends Chung…

Multiple harmonic-like numbers are studied using the generating function approach. A closed form is stated for binomial sums involving these numbers and two additional parameters. Several corollaries and examples are presented which are…

With this work we aim to show how Mathematica can be a useful tool to investigate properties of combinatorial structures. Specifically, we will face enumeration problems on independent subsets of powers of paths and cycles, trying to…