Related papers: Asymmetric extension of Pascal-Dellanoy triangles
In this manuscript, we introduce (symmetric) Tetranacci polynomials $\xi_j$ as a twofold generalization of ordinary Tetranacci numbers, by considering both non unity coefficients and generic initial values in their recursive definition. The…
In this article we investigate the lattices of Dyck paths of type $A$ and $B$ under dominance order, and explicitly describe their Heyting algebra structure. This means that each Dyck path of either type has a relative pseudocomplement with…
For $0\leq k \leq n$, the number $C(n,k)$ represents the number of all lattice paths in the plane from the point $(0,0)$ to the point $(n,k)$, using steps $(1,0)$ and $(0,1)$, that never rise above the main diagonal $y=x$. The Fuss-Catalan…
Nonextensive statistical mechanics has been a source of investigation in mathematical structures such as deformed algebraic structures. In this work, we present some consequences of $q$-operations on the construction of $q$-numbers for all…
We consider a class of generalized binomials emerging in fractional calculus. After establishing some general properties, we focus on a particular yet relevant case, for which we provide several ready-for-use combinatorial identities,…
Linear recurrent sequences are those whose elements are defined as linear combinations of preceding elements, and finding recurrence relations is a fundamental problem in computer algebra. In this paper, we focus on sequences whose elements…
In his famous theorem (1982), Douglas Leonard characterized the $q$-Racah polynomials and their relatives in the Askey scheme from the duality property of $Q$-polynomial distance-regular graphs. In this paper we consider a nonsymmetric (or…
We obtain new explicit formulas for the recurrence coefficients of the q-orthogonal polynomial sequences in a class that extends the q-Askey scheme. Our formulas express the recurrence coefficients in terms of four parameters that determine…
The Lucas sequence is a sequence of polynomials in s, and t defined recursively by {0}=0, {1}=1, and {n}=s{n-1}+t{n-2} for n >= 2. On specialization of s and t one can recover the Fibonacci numbers, the nonnegative integers, and the…
The theme of this article is a "reciprocity" between bounded up-down paths and bounded alternating sequences. Roughly speaking, this ``reciprocity" manifests itself by the fact that the extension of the sequence of numbers of paths of…
New bispectral polynomials orthogonal on a quadratic bi-lattice are obtained from a truncation of Wilson polynomials. Recurrence relation and difference equation are provided. The recurrence coefficients can be encoded in a perturbed…
The fairly recent discovery of "quasicrystals", whose X-ray diffraction patterns reveal certain peculiar features which do not conform with spatial periodicity, has motivated studies of the wave-dynamical implications of "aperiodic order".…
The polynomial relationship between elementary symmetric functions (Cauchy enumeration formula) is formulated via a ``raising operator" and Fock space construction. A simple graphical proof of this relation is proposed. The new operator…
We identify and study a matrix algebra consisting of Pascal-type matrices. The generator of the matrix algebra is shown to well define a canonical bundle map, called the Pascal map on jet bundles, and we use it to give an intrinsic…
In this paper, firstly, by a determinant of deformed Pascal's triangle, namely the normalized Hessenberg matrix determinant, to count Dyck paths, we give another combinatorial proof of the theorems which are of Catalan numbers determinant…
The algebraic area probability distribution of closed planar random walks of length N on a square lattice is considered. The generating function for the distribution satisfies a recurrence relation in which the combinatorics is encoded. A…
The article contains some important classes of multisets. Combinatorial proofs of problems on the number of m-submultisets and m-permutations of multiset elements are considered and effective algorithms for their calculation are given. In…
We compute an analogue of Pascal's triangle enriched in bilinear forms over a finite field. This gives an arithmetically meaningful count of the ways to choose $j$ ring homomorphisms into an algebraic closure from an \'etale extension of…
Quasi-complementary sequence sets (QCSSs) can be seen as a generalized version of complete complementary codes (CCCs), which enables multicarrier communication systems to support more users. The contribution of this work is two-fold. First,…
We generalize Bonahon-Wong's $\mathrm{SL}_2(\mathbb{C})$-quantum trace map to the setting of $\mathrm{SL}_3(\mathbb{C})$. More precisely, given a non-zero complex parameter $q=e^{2 \pi i \hbar}$, we associate to each isotopy class of framed…