From fibonacci to robbins : Series reversion and hankel transforms

Barry, Paul (2021) From fibonacci to robbins : Series reversion and hankel transforms. Journal of Integer Sequences, 24 (10). ISSN 1530-7638

Full text not available from this repository. (Request a copy)


The Robbins numbers An have an important place in the study of plane partitions and in the study of alternating sign matrices. A simple closed formula exists for these numbers, but its derivation entails quite sophisticated machinery. Building on this basis, we study the Robbins numbers from a more elementary standpoint, based on series reversion and Hankel transforms. We show how a transformation pipeline can lead from the Fibonacci numbers to the Robbins numbers. We employ the language of Riordan arrays to carry out many of the transformations of the generating functions that we use. We establish links between the revert transforms under discussion and certain scaled moment sequences of a family of continuous Hahn polynomials. Finally we show that a family of quasi-Fibonacci polynomials of 7th order play a fundamental role in this theory.

Item Type: Article
Additional Information: Publisher Copyright: © 2021, University of Waterloo. All rights reserved.
Uncontrolled Keywords: /dk/atira/pure/subjectarea/asjc/2600/2607
Departments or Groups:
Depositing User: Admin SSL
Date Deposited: 19 Oct 2022 23:03
Last Modified: 08 Feb 2023 19:38

Actions (login required)

View Item View Item