Related papers: Asymmetric extension of Pascal-Dellanoy triangles
The trinomial transform of a sequence is a generalization of the well-known binomial transform, replacing binomial coefficients with trinomial coefficients. We examine Pascal-like triangles under trinomial transform, focusing on the ternary…
The binomial interpolated transform of a sequence is a generalization of the well-known binomial transform. We examine a Pascal-like triangle, on which a binomial interpolated transform works between the left and right diagonals, focusing…
In this paper, we introduce a new generalization of Pascal's triangle. The new object is called the hyperbolic Pascal triangle since the mathematical background goes back to regular mosaics on the hyperbolic plane. We describe precisely the…
We introduce a generalization of Pascal triangle based on binomial coefficients of finite words. These coefficients count the number of times a word appears as a subsequence of another finite word. Similarly to the Sierpi\'nski gasket that…
The summation formula within pascalian triangle resulting in the fibonacci sequence is extended to the $q$-binomial coefficients $q$-gaussian triangles.
Pascal's triangle is widely used as a pedagogical tool to explain the "first-order" multiplet patterns that arise in the spectra of $I_N S$ coupled spin-1/2 systems in magnetic resonance. Various other combinatorial structures, which may be…
The generalized Fibonacci recurrence $g_n=g_{n-k}+g_{n-m}$ was recently used to demonstrate the theoretically optimal nature of limited senescence in morphologically symmetrically dividing bacteria. Here, we study this recurrence from a…
The purpose of this article is to study determinants of matrices which are known as generalized Pascal triangles (see [1]). We present a factorization by expressing such a matrix as a product of a unipotent lower triangular matrix, a…
The Fibonacci sequence is obtained as weighted sum along the rows in the Pascal triangle by choosing a periodic up-and-down pattern of weights from the set $\{-1,-\frac{1}{2},0, \frac{1}{2}, 1\}$. A graphical illustration of this identity…
A circular Pascal array is a periodization of the familiar Pascal's triangle. Using simple operators defined on periodic sequences, we find a direct relationship between the ranges of the circular Pascal arrays and numbers of certain…
We pursue the investigation of generalizations of the Pascal triangle based on binomial coefficients of finite words. These coefficients count the number of times a finite word appears as a subsequence of another finite word. The finite…
This paper is about counting the number of distinct (scattered) subwords occurring in a given word. More precisely, we consider the generalization of the Pascal triangle to binomial coefficients of words and the sequence $(S(n))_{n\ge 0}$…
This article demonstrates, using numerous examples of varying complexity, how one can visually prove summation formulas involving binomial coefficients by exclusively using the recurrence relation for binomial coefficients and its…
Recently, a new generalization of Pascal's triangle, the so-called hyperbolic Pascal triangles were introduced. The mathematical background goes back to the regular mosaics in the hyperbolic plane. In this article, we investigate the paths…
We investigate paths in Bernoulli's triangles, and derive several relations linking the partial sums of binomial coefficients to the Fibonacci numbers.
We establish the coarse relative trace formulae of Jacquet-Rallis for linear and unitary groups. Both formulae are of the form: a sum of spectral distributions equals a sum of geometric distributions. In order to obtain the spectral…
The cyclic sieving phenomenon provides a link between a polynomial analogue of Gauss congruence known as $q$-Gauss congruence, and a combinatorial analogue of Gauss congruence based on sequences of cyclic group actions. We strengthen this…
The close relationship among the polynomial functions and Fibonacci numerical sequences is shown in this paper. These numerical sequences are defined by the recurrence equation $x_{k + n} = \displaystyle\sum_{j = 0}^{n-1}\alpha_j x_{k +…
New bispectral orthogonal polynomials are obtained from an unconventional truncation of the Askey-Wilson polynomials. In the limit $q \to 1$, they reduce to the para-Racah polynomials which are orthogonal with respect to a quadratic…
In this paper we consider a quantum version of Pascal's triangle. Pascal's triangle is a well-known triangular array of numbers and when these numbers are plotted modulo 2, a fractal known as the Sierpinski triangle appears. We first prove…