The run transform

DOI10.1016/J.DISC.2012.05.009MaRDI QIDQ449135zbMATH OpenOpenAlexFDO

Authors David Callan, Emeric Deutsch

Publication date 12 September 2012

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1112.3639

zbMATH Keywords

Dyck pathnoncrossing partitionincreasing runpyramid ascent

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Partitions of sets (05A18)

Abstract: We consider the transform from sequences to triangular arrays defined in terms of generating functions by f(x) -> (1-x)/(1-xy) f(x(1-x)/(1-xy)). We establish a criterion for the transform of a nonnegative sequence to be nonnegative, and we show that the transform counts certain classes of lattice paths by number of "pyramid ascents", as well as certain classes of ordered partitions by number of blocks that consist of increasing consecutive integers.

Recommendations

• On a transformation of Riordan moment sequences
• The trinomial transform triangle
• Tetrahedron trinomial coefficient transform
• Continued fractions and transformations of integer sequences
• Some sequences of integers

Cites work

• scientific article; zbMATH DE number 45266 (Why is no real title available?)
• scientific article; zbMATH DE number 3570467 (Why is no real title available?)
• A bijection on Dyck paths and its cycle structure
• Analytic combinatorics
• Combinatorial interpretations of convolutions of the Catalan numbers
• Sets, Lists and Noncrossing Partitions
• Uniform Partitions of Lattice Paths and Chung-Feller Generalizations

Cited in

(1)

• Nonleft peaks in Dyck paths: a combinatorial approach

Describes a project that uses

Uses Software

• OEIS

This page was built for publication: The run transform

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q449135)