Valleyless sequences

MaRDI QIDQ2716515zbMATH OpenFDO

Authors Robert G. Rieper, Melkamu Zeleke

Publication date 16 May 2001

Published in Congressus Numerantium (Search for Journal in Brave)

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

zbMATH Keywords

generating functionspermutationstree enumerationvalleyless sequences

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Exact enumeration problems, generating functions (05A15)

Recommendations

• Enumeration problems of sets of increasing and decreasing n-valued serial sequences with double-ended constraints on series heights
• Numeration of non-decreasing and non-increasing n-valued serial sequences
• Algorithms for enumeration of single-transition serial sequences
• scientific article; zbMATH DE number 5800998
• Solutions of the enumeration problems for serial sequences with a constant difference of the heights of the neighboring series

Cited in

(3)

• Enumerating permutations by their run structure
• Whole mirror duplication-random loss model and pattern avoiding permutations
• Introduction to partially ordered patterns

This page was built for publication: Valleyless sequences

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