Algorithms for enumeration of single-transition serial sequences
From MaRDI portal
Recommendations
- Enumerative problems solution for single-transition serial sequences with an adjacent series heights increment bounded from above
- 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
- Solutions of the enumeration problems for serial sequences with a constant difference of the heights of the neighboring series
- scientific article; zbMATH DE number 5800998
Cited in
(12)- Algorithms for the exact solution of the problems of enumeration, coding, and generation of serial sequences
- Valleyless sequences
- Numeration of non-decreasing and non-increasing n-valued serial sequences
- Recalculation, numbering and generation of serial sequences with detached natural series
- scientific article; zbMATH DE number 53746 (Why is no real title available?)
- scientific article; zbMATH DE number 4123514 (Why is no real title available?)
- scientific article; zbMATH DE number 1286135 (Why is no real title available?)
- scientific article; zbMATH DE number 1286249 (Why is no real title available?)
- Enumerative problems solution for single-transition serial sequences with an adjacent series heights increment bounded from above
- Solutions of the enumeration problems for serial sequences with a constant difference of the heights of the neighboring series
- Enumeration problems of sets of increasing and decreasing n-valued serial sequences with double-ended constraints on series heights
- The enumeration of sequences with restrictions on their partial sums
This page was built for publication: Algorithms for enumeration of single-transition serial sequences
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5398274)
