Numeration of non-decreasing and non-increasing serial sequences

Article
  • 18 Downloads

Abstract

Finite sets of n-valued serial sequences are examined. Their structure is determined not only by restrictions on the number of series and series lengths, but also by restrictions on the series heights, which define the order number of series and their lengths, but also is limited to the series heights, by whose limitations the order of series of different heights is given. Solutions to numeration and generation problems are obtained for the following sets of sequences: non-decreasing and non-increasing sequences where the difference in heights of the neighboring series is either not smaller than a certain value or not greater than a certain value. Algorithms that assign smaller numbers to lexicographically lower sequences and smaller numbers to lexicographically higher sequences are developed.

Key words

series serial sequences series length series height restrictions 

References

  1. 1.
    Amelkin, V.A., Perechislitelnye zadachi seriinykh posledovatelnostei (Numeration Problems of Serial Sequences), Novosibirsk: Inst. Comput. Math. and Math. Geophys., Sib. Branch, Russ. Acad. Sci., 2008.Google Scholar
  2. 2.
    Egorychev, G.P., Integralnoe predstavlenie i vychislenie kombinatornykh summ (Integral Presentation and Calculation of Combinatorial Sums), Novosibirsk: Nauka, 1977.Google Scholar
  3. 3.
    Covet, T.M., Enumerative Source Encoding, IEEE Trans. Inform. Theory, 1973, vol. 19, no. 1, pp. 73–77.CrossRefGoogle Scholar
  4. 4.
    Amelkin, V.A., Enumeration Problems for Oriented Serial Sequences, Numer. Anal. Appl., 2008, vol. 1, no. 3, pp. 223–232.CrossRefGoogle Scholar

Copyright information

© Pleiades Publishing, Ltd. 2009

Authors and Affiliations

  1. 1.Institute of Computational Mathematics and Mathematical Geophysics, Siberian BranchRussian Academy of SciencesNovosibirskRussia

Personalised recommendations