From fibonacci to robbins: Series reversion and hankel transforms

Paul Barry

Research output: Contribution to journalArticlepeer-review

Abstract

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.

Original languageEnglish
Article number21.10.2
JournalJournal of Integer Sequences
Volume24
Issue number10
Publication statusPublished - 2021

Keywords

  • Alternating sign matrice
  • Composition
  • Continuous Hahn polynomial
  • Fibonacci number
  • Generating function
  • Plane partition
  • Quasi-Fibonacci polynomial
  • Robbins number
  • Sequence Hankel transform
  • Series reversion

Fingerprint

Dive into the research topics of 'From fibonacci to robbins: Series reversion and hankel transforms'. Together they form a unique fingerprint.

Cite this