A New Group in the Riordan Family of Matrix Groups: the Sprugnoli Group

We define a group of lower-triangular matrices whose columns are defined by power series. This group can be seen as a generalization of the (ordinary) Riordan group and the double Riordan group. Elements of this group are defined by three power series. Sequence bisections and vertically stretched Riordan arrays play an important role in the formulation of this group. We give a production matrix characterization of this new group. We have chosen to name this group in memory of Renzo Sprugnoli, who was a pioneer in the application of the Riordan group to combinatorial problems as well as contributing to an understanding of the rich structure of Riordan arrays. We indicate how higher order groups can be defined, based on $n$-tuples of power series and $n$-sections of sequences that they operate on.

Authors

Institutions

Publication Details

Journal
The Electronic Journal of Combinatorics
Published
2026-11-06
DOI
https://doi.org/10.37236/15613
Citations
2
Primary Topic
Advanced Combinatorial Mathematics
Type
article
Field-Weighted Citation Impact
4.02
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
article

A New Group in the Riordan Family of Matrix Groups: the Sprugnoli Group

Paul Barry
2 citations
The Electronic Journal of Combinatorics
Advanced Combinatorial Mathematics
4.02
article

A New Group in the Riordan Family of Matrix Groups: the Sprugnoli Group

Paul Barry
article en
2 citations

Abstract

We define a group of lower-triangular matrices whose columns are defined by power series. This group can be seen as a generalization of the (ordinary) Riordan group and the double Riordan group. Elements of this group are defined by three power series. Sequence bisections and vertically stretched Riordan arrays play an important role in the formulation of this group. We give a production matrix characterization of this new group. We have chosen to name this group in memory of Renzo Sprugnoli, who was a pioneer in the application of the Riordan group to combinatorial problems as well as contributing to an understanding of the rich structure of Riordan arrays. We indicate how higher order groups can be defined, based on $n$-tuples of power series and $n$-sections of sequences that they operate on.

The Electronic Journal of CombinatoricsVol. 33(4)
South East Technological University (IE)
Openalex Percentile: Top 6%
Advanced Combinatorial Mathematics
4.02
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon