Related papers: An Identity for Vertically Aligned Entries in Pasc…
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…
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…
We prove several evaluations of determinants of matrices, the entries of which are given by the recurrence $a_{i,j}=a_{i-1,j}+a_{i,j-1}$, or variations thereof. These evaluations were either conjectured or extend conjectures by Roland…
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…
In this paper we present a geometric approach to discovering some known and some new identities using triangular arrays. Our main aim is to demonstrate how to use the geometric patterns (by Carlitz), in the Pascal and Hosoya triangles to…
In two previous papers we have presented partition formulae for the Fibonacci numbers motivated by the appearance of the Fibonacci numbers in the representation theory of the 3-Kronecker quiver and its universal cover, the 3-regular tree.…
We study spaces of realisations of linkages (weighted graphs) whose underlying graph is a series parallel graph. In particular, we describe an algorithm for determining whether or not such spaces are connected.
In this paper we study derived equivalences between triangular matrix algebras using certain classical recollements. We show that special properties of these recollements actually characterize triangular matrix algebras, and describe…
In this paper we introduce a new type of Pascal's pyramids. The new object is called hyperbolic Pascal pyramid since the mathematical background goes back to the regular cube mosaic (cubic honeycomb) in the hyperbolic space. The definition…
The visibility graph of a simple polygon represents visibility relations between its vertices. Knowing the correct order of the vertices around the boundary of a polygon and its visibility graph, it is an open problem to locate the vertices…
In a previous paper, we derived necessary and sufficient conditions for the invertibility of square submatrices of the Pascal upper triangular matrix. To do so, we established a connection with the two-point Birkhoff interpolation problem.…
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…
In the classic "Concrete Math", by Graham, Patashnik and Knuth, it is stated that "The numbers in Pascal's triangle satisfy, practically speaking, infinitely many identities, so it is not too surprising that we can find some surprising…
The family of Euclidean triangles having some fixed perimeter and area can be identified with a subset of points on a nonsingular cubic plane curve, i.e., an elliptic curve; furthermore, if the perimeter and the square of the area are…
A new class of random spatial tessellations is introduced -- the so-called column tessellations of three-dimensional space. The construction is based on a stationary planar tessellation. Each cell of the spatial tessellation is a prism…
An elegant procedure which characterizes a decomposition of some class of binomial configurations into two other, resembling a definition of Pascal's Triangle, was given in \cite{gevay}. In essence, this construction was already presented…
Pascal's triangle will give the number of geodesics from the identity to each point of ${\bf Z}^2$ if you write it in each of the quadrants. Given a group $G$ and generating set $\cal G$ we take the {\it Pascal's function} $p_{\cal G}: G…
We have found some patterns in some triangles.
The Catalan triangle, as well as a Fuss-Catalan triangle, enter a problem of counting particular tied arc diagrams. This setting allows us to prove some combinatorial properties of these triangles.
It will be shown that Pascal's Theorem is equivalent to the associativity of a natural binary operation on conic sections. A novel proof for Pascal's Theorem will then be given by showing that this binary operation is associative…