On strongly reversible elements in the Riordan group

An element of a group is called reversible if it is conjugate to its inverse, and strongly reversible if it can be expressed as a product of two involutions. We study strongly reversible elements in the Riordan group and its various important subgroups. We prove that not every reversible element in the Riordan group is strongly reversible, and we investigate products of reversible elements in the Riordan group.

Authors

Institutions

Publication Details

Journal
Linear and Multilinear Algebra
Published
2026-10-15
DOI
https://doi.org/10.1080/03081087.2026.2748869
Primary Topic
Finite Group Theory Research
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

On strongly reversible elements in the Riordan group

Roksana Słowik, Tejbir Lohan
Linear and Multilinear Algebra
Finite Group Theory Research
article

On strongly reversible elements in the Riordan group

Roksana Słowik, Tejbir Lohan
article en

Abstract

An element of a group is called reversible if it is conjugate to its inverse, and strongly reversible if it can be expressed as a product of two involutions. We study strongly reversible elements in the Riordan group and its various important subgroups. We prove that not every reversible element in the Riordan group is strongly reversible, and we investigate products of reversible elements in the Riordan group.

Linear and Multilinear Algebra
Silesian University of Technology (PL), Indian Statistical Institute (IN)
Openalex Percentile: Top 5%
Finite Group Theory Research
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.