相关论文: The Double Almost-Riordan Arrays and Their Sequenc…
This is the second paper of the paper series on multiple Riordan arrays. In this paper, based on the study of multiple Riordan arrays and the multiple Riordan group, we define multiple almost-Riordan arrays and find that the set of all…
In this paper the total positivity of quasi-Riordan arrays is investigated with use of the sequence characterization of quasi-Riordan arrays. Due to the correlation between quasi-Riordan arrays and Riordan arrays, this study is an in-depth…
This is the first paper of a sequence papers on the multiple Riordan group and the multiple Riordon type arrays. We give a comprehensive discussion of the multiple Riordan arrays and characterize them by an $A$-sequence and multiple…
In this paper we study the total positivity of almost-Riordan arrays $(d(t)|\, g(t), f(t))$ and establish its necessary conditions and sufficient conditions, particularly, for some well used formal power series $d(t)$. We present a…
We study a super group of the group of Riordan arrays, where the elements of the group are given by a triple of power series. We show that certain subsets are subgroups, and we identify a normal subgroup whose cosets correspond to Riordan…
The group of almost Riordan arrays contains the group of Riordan arrays as a subgroup. In this note, we exhibit examples of pseudo-involutions, involutions and quasi-involutions in the group of almost Riordan arrays.
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 present sufficient conditions for total positivity of Riordan arrays. As applications we show that many well-known combinatorial triangles are totally positive and many famous combinatorial numbers are log-convex in a unified approach.
The Riordan group is a set of infinite lower-triangular matrices defined by two generating functions, $g$ and $f$. The elements of the group are called Riordan arrays, denoted by $(g,f)$, and the $k$th column of a Riordan array is given by…
In this paper we define and study a family of codes which come close to be MRD codes, so we call them AMRD codes (almost MRD). An AMRD code is a code with rank defect equal to 1. AMRD codes whose duals are AMRD are called dually AMRD.…
A vertical recursive relation approach to Riordan arrays is induced, while the horizontal recursive relation is represented by $A$- and $Z$-sequences. This vertical recursive approach gives a way to represent the entries of a Riordan array…
The main goal of this paper is to introduce and to investigate properties of generalized Riordan arrays and generalized Riordan groups that involve formal semi-Laurent series. In particular, we focus on the problem of isomorphy of…
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…
We introduce near triple arrays as binary row-column designs with at most two consecutive values for the replication numbers of symbols, for the intersection sizes of pairs of rows, pairs of columns and pairs of a row and a column. Near…
A Riordan array is defined by its production matrix. In this paper, we explore the notion of the second production matrix of a Riordan array, characterizing the matrix that is generated by it. We indicate how this procedure can be…
For an integer $p\geq 2$ we construct vertical and horizontal one-pth Riordan arrays from a Riordan array. When $p=2$, one-pth Riordan arrays reduced to well known half Riordan arrays. The generating functions of the $A$-sequences of…
Let $R=\mathcal{R}(d(t),h(t))$ be a Riordan array, where $d(t)=\sum_{n\ge 0}d_nt^n$ and $h(t)=\sum_{n\ge 0}h_nt^n$. We show that if the matrix \begin{equation*} \left[\begin{array}{ccccc} d_0 & h_0 & 0 & 0 &\cdots\\ d_1 & h_1 & h_0 & 0 &\\…
The aim of this paper is to present the main constructions of the substructures of an almost groupoid and to discuss their basic properties. The definitions and properties concerning these new algebraic constructions extend to almost…
Gowers has elegantly characterized the finite groups $G$ in which $A_1A_2A_3 = G$ for any positive density subsets $A_1,A_2,A_3$. This property, quasi-randomness, holds if and only if G does not admit a nontrivial irreducible representation…
We characterize certain Riordan arrays by their $A$-matrices and $\rho$ sequences. We conjecture the form of a generic $A$-matrix which leads to Somos $4$ sequences. We find an $A$-matrix that produces a Riordan quasi-involution, and we…