Related papers: Asymmetric extension of Pascal-Dellanoy triangles
Part I: The two-dimensional Pascal Triangle will be generalized into a three-dimensional Pascal Pyramid and four-, five- or whatsoever-dimensional hyper-pyramids. Part II: The Bilateral Binomial Theorem will be generalised into a Bilateral…
A "truncation" of Pascal's triangle is a triangular array of numbers that satisfies the usual Pascal recurrence but with a boundary condition that declares some terminal set of numbers along each row of the array to be zero. Presented here…
The aim of this paper is to find a general formula to generate any row of Pascal's triangle as an extension of the concept of $\left(11\right)^{n}$. In this study, the visualization of each row of Pascal's triangle has been presented by…
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.
We show that the $n$'th diagonal sum of Barry's modified Pascal triangle can be described as the continuant of the run lengths of the binary representation of $n$. We also obtain an explicit description for the row sums.
We derive a series of results on random walks on a d-dimensional hypercubic lattice (lattice paths). We introduce the notions of terse and simple paths corresponding to the path having no backtracking parts (spikes). These paths label…
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…
In this paper we develop a new geometric method to answer the log-concavity questions related to a nice class of combinatorial sequences arising from the Pascal triangle.
We define and characterize the $f$-matrices associated to Pascal-like matrices that are defined by ordinary and exponential Riordan arrays. These generalize the face matrices of simplices and hypercubes. Their generating functions can be…
Generalized Pascal matrix whose elements are generalized binomial coefficients is included in the group of generalized Riordan arrays. There is a special set of generalized Riordan arrays defined by parameter $q$. If $q=0$, they are…
In this paper we present the construction of explicit quasi-isomorphisms that compute the cyclic homology and periodic cyclic homology of crossed-product algebras associated with (discrete) group actions. In the first part we deal with…
A new generalization of Pascal's triangle, the so-called hyperbolic Pascal triangles were introduced in [H.B, L.N, L.Sz: Hyperbolic Pascal triangles]. The mathematical background goes back to the regular mosaics in the hyperbolic plane. The…
Spectral quasi correlations are small sums of lattice points lying on the same circle; we show that, for generic integers representable as the sum of two squares, there are no spectral quasi-correlations. Moreover, we apply our result to…
In this paper, we define Tribonacci-Lucas polynomials and present Tribonacci-Lucas numbers and polynomials as a binomial sum. Then, we introduce incomplete Tribonacci-Lucas numbers and polynomials. In addition we derive recurrence…
Relying on rays, we search for submodules of a module V over a supertropical semiring on which a given anisotropic quadratic form is quasilinear. Rays are classes of a certain equivalence relation on V, that carry a notion of convexity,…
We consider two families of Pascal-like triangles that have all ones on the left side and ones separated by $m-1$ zeros on the right side. The $m=1$ cases are Pascal's triangle and the two families also coincide when $m=2$. Members of the…
Path pairs are a modification of parallelogram polyominoes that provide yet another combinatorial interpretation of the Catalan numbers. More generally, the number of path pairs of length $n$ and distance $\delta$ corresponds to the…
We consider $m$-th order linear recurrences that can be thought of as generalizations of the Lucas sequence. We exploit some interplay with matrices that again can be considered generalizations of the Fibonacci matrix. We introduce the…
Divisibility sequences are defined by the property that their elements divide each other whenever their indices do. The divisibility sequences that also satisfy a linear recurrence, like the Fibonacci numbers, are generated by polynomials…
Random walks are a series of up, down, and level steps that enumerate distinct paths from $(0,0)$ to $(2n,0)$, where $n$ is the semi-length of the path. We used these paths to analyze Catalan, Schr\"{o}der, and Motzkin number sequences…