|
Sibirskii Zhurnal Vychislitel'noi Matematiki, 2012, Volume 15, Number 1, Pages 21–29
(Mi sjvm455)
|
|
|
|
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.
Received: 27.10.2010
Citation:
V. A. Amelkin, “Enumeration problems solutions for serial sequences with a permanent difference in adjacent series heights”, Sib. Zh. Vychisl. Mat., 15:1 (2012), 21–29; Num. Anal. Appl., 5:1 (2012), 17–24
Linking options:
https://www.mathnet.ru/eng/sjvm455 https://www.mathnet.ru/eng/sjvm/v15/i1/p21
|
|