Enumeration problems solutions for serial sequences with a permanent difference in adjacent series heights

V. A. Amelkin

Institute of Computational Mathematics and Mathematical Geophysics (Computing Center), Siberian Branch of the Russian Academy of Sciences, Novosibirsk

Abstract: In this paper, the sets of $n$-value serial sequences are considered. The structure of such series is defined by constraints on the number of series, the length of series, and the height of series. The problem of recalculation, numeration, and generation has been solved for the sets of ascending, descending, and one-transitive sequences with permanent differences in the adjacent series heights.

Key words: series length, series height, constraints, numerical coding.

UDC: 519.115

Received: 27.10.2010

 English version: Numerical Analysis and Applications, 2012, 5:1, 17–24

Bibliographic databases:

• 
•