
arXiv: 1112.3639
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.
18 pages
Increasing run, Exact enumeration problems, generating functions, noncrossing partition, Theoretical Computer Science, Noncrossing partition, Partitions of sets, FOS: Mathematics, Discrete Mathematics and Combinatorics, Mathematics - Combinatorics, Dyck path, Combinatorics (math.CO), pyramid ascent, Pyramid ascent, increasing run, 05A15
Increasing run, Exact enumeration problems, generating functions, noncrossing partition, Theoretical Computer Science, Noncrossing partition, Partitions of sets, FOS: Mathematics, Discrete Mathematics and Combinatorics, Mathematics - Combinatorics, Dyck path, Combinatorics (math.CO), pyramid ascent, Pyramid ascent, increasing run, 05A15
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 2 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
