1997/04/01 by Donatella Merlini, Douglas G. Rogers, Renzo Sprugnoli +1 · 19 citations
Mathematics · Biochemistry, Genetics and Molecular Biology · #Advanced Combinatorial Mathematics #Genome Rearrangement Algorithms
paper · pdf · doi:10.4153/cjm-1997-015-x
Abstract We give several new characterizations of Riordan Arrays, the most important of which is: if d n,k n,k ∈ N is a lower triangular arraywhose generic element d n,k linearly depends on the elements in a well-defined though large area of the array, then d n,k n,k ∈ N is Riordan. We also provide some applications of these characterizations to the lattice path theory.