Related papers: Arrow-chasing in Pascal's triangle -- Visual proof…
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…
For an arbitrary homogeneous linear recurrence sequence of order d with constant coefficients, we derive recurrence relations for all subsequences with indices in arithmetic progression. The coefficients of these recurrences are given…
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…
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…
Many sequences of binomial coefficients share various unimodality properties. In this paper we consider the unimodality problem of a sequence of binomial coefficients located in a ray or a transversal of the Pascal triangle. Our results…
A symbolic method for solving linear recurrences of combinatorial and statistical interest is introduced. This method essentially relies on a representation of polynomial sequences as moments of a symbol that looks as the framework of 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…
We give a simplified presentation of some results about recurrences of certain sequences of binomial sums in terms of (generalized) Fibonacci and Lucas polynomials.
For a fixed integer N, and fixed numbers b_1,...,b_N, we consider sequences, the nth term (a_n) of which is the sum of the squares of the terms in the expansion of (b_1 + ... + b_N)^n. In the case all b_i=1, we give a formula for a…
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}$…
The paper describes a new algorithm of construction of the nonlinear arithmetic triangle on the basis of numerical simulation and the binary system. It demonstrates that the numbers that fill the nonlinear arithmetic triangle may be…
A polynomial triangle is an array whose inputs are the coefficients in integral powers of a polynomial. Although polynomial coefficients have appeared in several works, there is no systematic treatise on this topic. In this paper we plan to…
By combining the telescoping method with an algebraic relation, four classes of binomial moments are examined. Several explicit summation formulae are established.
In this work we provide a novel approach for computing the coefficients of the characteristic polynomial of a square matrix. We demonstrate that each coefficient can be efficiently represented by a set of circle graphs. Thus, one can employ…
Binomial coefficients have been used for centuries in a variety of fields and have accumulated numerous definitions. In this paper, we introduce a new way of defining binomial coefficients as repeated sums of ones. A multitude of binomial…
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…
In this paper, we present an algorithm which allows us to search for all the bisections for the binomial coefficients $\{\binom{n}{k} \}_{k=0,...,n}$ and include a table with the results for all $n\le 154$. Connections with previous work on…
We give a combinatorial proof of a formula giving the partial sums of the $k$-bonacci sequence as alternating sums of powers of two multiplied by binomial coefficients. As a corollary we obtain a formula for the $k$-bonacci numbers.
The classic way to write down Pascal's triangle leads to entries in alternating rows being vertically aligned. In this paper, we prove a linear dependence on vertically aligned entries in Pascal's triangle. Furthermore, we give an…