Related papers: Production matrices and Riordan arrays

We introduce a method for describing Riordan matrices via recurrence relations along their diagonals. This provides a new structural description that complements the classical row-wise and column-wise constructions via the A-sequence. As an…

Random matrix products arise in many science and engineering problems. An efficient evaluation of its growth rate is of great interest to researchers in diverse fields. In the current paper, we reformulate this problem with a generating…

In this paper we outline a Matrix Ansatz approach to some problems of combinatorial enumeration. The idea is that many interesting quantities can be expressed in terms of products of matrices, where the matrices obey certain relations. We…

We define recurrence matrices and study a few properties (links with automatic sequences, branch groups etc.) of them.

We define matrix models that converge to the generating functions of a wide variety of loop models with fugacity taken in sets with an accumulation point. The latter can also be seen as moments of a non-commutative law on a subfactor planar…

Proof search has been used to specify a wide range of computation systems. In order to build a framework for reasoning about such specifications, we make use of a sequent calculus involving induction and co-induction. These proof principles…

A well-known problem in computing some matrix functions iteratively is the lack of a clear, commonly accepted residual notion. An important matrix function for which this is the case is the matrix exponential. Suppose the matrix exponential…

In this paper, we study the Euler-Seidel matrices with coefficients and determine the associated Riordan matrix to a given matrix, if it does exist. Computation of the generating fonction of the final sequence is established by the…

Sigmoid functions play an important role in many areas of applied mathematics, including machine learning, population dynamics and probability. We place the study of sigmoid functions in the context of the derivative sub-group of the group…

Using the theoretical basis developed by Yao and Zeilberger, we consider certain graph families whose structure results in a rational generating function for sequences related to spanning tree enumeration. Said families are Powers of Cycles…

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…

A systematic theory is introduced for calculating the derivatives of quaternion matrix function with respect to quaternion matrix variables. The proposed methodology is equipped with the matrix product rule and chain rule and it is able to…

We provide an alternative description of the group of Riordan arrays, by using two power series of the form $\sum_{n=0}^{\infty} g_n x^n$, where $g_0 \ne 0$ to build a typical element of the constructed group. We relate these elements to…

The classical Riordan groups associated to a given commutative ring are groups of infinite matrices (called Riordan arrays) associated to pairs of formal power series in one variable. The Fundamental Theorem of Riordan Arrays relates matrix…

We examine the use of classes to formulate several categorical notions. This leads to two proposals: an explicit structure for working with subobjects, and a hierarchy of $k$-classes. We apply the latter to both ordinary and higher…

We propose an original approach to the problem of rankunimodality for Dyck lattices. It is based on a well known recursive construction of Dyck paths originally developed in the context of the ECO methodology, which provides a partition of…

We consider Riordan arrays $\bigl(1/(1-t^{d+1}), ~ tp(t)\bigr)$. These are infinite lower triangular matrices determined by the formal power series $1/(1-t^{d+1})$ and a polynomial $p(t)$ of degree $d$. Columns of such matrix are eventually…

We develop a method using parameterized linear equations to define trading mechanisms in market design models. Our method adeptly addresses challenges arising from factors such as complex endowments or coarse priorities, while offering…

This paper introduces a class of objects called decision rules that map infinite sequences of alternatives to a decision space. These objects can be used to model situations where a decision maker encounters alternatives in a sequence such…

We put forward new general criteria to design successor rules that generate binary de Bruijn sequences. Prior fast algorithms based on successor rules in the literature are then shown to be special instances. We implemented the criteria to…