Related papers: Matrices about the lattice paths
We prove new bijections between different variants of Dyck paths and integer compositions, which give combinatorial explanations of their simple counting formula $4^{n-1}$. These give relations between different statistics, such as the…
We study a class of combinatorial objects that we call "decorated trees". These consist of vertices, arrows and edges, where each edge is decorated by two integers (one near each of its endpoints), each arrow is decorated by an integer, and…
A combinatorial methods are used to investigate some properties of certain generalized Stirling numbers, including explicit formula and recurrence relations. Furthermore, an expression of these numbers with symmetric function is deduced.
We introduce a new method for discovering matrix multiplication schemes based on random walks in a certain graph, which we call the flip graph. Using this method, we were able to reduce the number of multiplications for the matrix formats…
In this work I look at the distribution of primes by calculation of an infinite number of intersections. For this I use the set of all numbers which are not elements of a certain times table in each case. I am able to show that it exists a…
In this paper, we present a novel method to compute an explicit formula for the inverse of the confluent Vandermonde matrices. Our proposed results may have many interesting perspectives in diverse areas of mathematics and natural sciences,…
We use elementary methods to establish three key recurrence relations: one for derangement numbers, a second for harmonic numbers, and a third for degenerate harmonic numbers. Our results not only contribute to the understanding of the…
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 investigate invertible matrices over finite additively idempotent semirings. The main result provides a criterion for the invertibility of such matrices. We also give a construction of the inverse matrix and a formula for the number of…
This text investigates relations between two well-known family of algorithms, matrix factorisations and recursive linear filters, by describing a probabilistic model in which approximate inference corresponds to a matrix factorisation…
In this paper we propose a unified approach to matrix representations of different types of Appell polynomials. This approach is based on the creation matrix - a special matrix which has only the natural numbers as entries and is closely…
We produce a hierarchiy of integrable equations by systematically adding terms to the Lax pair for the lattice modified KdV equation. The equations in the hierarchy are related to one aonother by recursion relations. These recursion…
We study the number of factorizations of a positive integer, where the parts of the factorization are of l different colors (or kinds). Recursive or explicit formulas are derived for the case of unordered and ordered, distinct and…
This thesis deals with the enumerative study of combinatorial maps, and its application to the enumeration of other combinatorial objects. Combinatorial maps, or simply maps, form a rich combinatorial model. They have an intuitive and…
Square matrices of the form $\widetilde{\mathbf{A}} =\mathbf{A} + \mathbf{e}D \mathbf{f}^*$ are considered. An explicit expression for the inverse is given, provided $\widetilde{\mathbf{A}}$ and $D$ are invertible with…
Following the work of Cano and Diaz, we consider a continuous analog of lattice path enumeration. This allows us to define a continuous version of any discrete object that counts certain types of lattice paths. We define continuous versions…
We discuss the hard-hexagon and hard-square problems, as well as the corresponding problem on the honeycomb lattice. The case when the activity is unity is of interest to combinatorialists, being the problem of counting binary matrices with…
We give a formula for matrix exponentials and partial fraction decompositions.
We show how lattice paths and the reflection principle can be used to give easy proofs of unimodality results. In particular, we give a "one-line" combinatorial proof of the unimodality of the binomial coefficients. Other examples include…
We propose a new method to enumerate alternating knots using a transfer matrix approach. We apply it to count numerically various objects, including prime alternating tangles with two connected components, up to order 18--22, and comment on…