|
Sibirskii Zhurnal Vychislitel'noi Matematiki, 2008, Volume 11, Number 3, Pages 271–282
(Mi sjvm47)
|
|
|
|
This article is cited in 1 scientific paper (total in 1 paper)
Enumeration problems of oriented serial sequences
V. A. Amelkin Institute of Computational Mathematics and Mathematical Geophysics (Computing Center), Siberian Branch of the Russian Academy of Sciences
Abstract:
The sets of $n$-valued $m$-sequences of a serial structure are considered. In addition to the conventional concepts of length of a series and the number of series in a sequence, the concepts of height of a series and series heights sequence are introduced. The structure of the sequences that are called oriented is determined from limitations on the number and the length of series, on order of sequencing of series of various heights.
A general approach to solving enumeration problems for sets of such sequences is proposed. It is based on formulas for the number of arrangements of elements in cells and the power of a set of height sequences. Exact solutions for some limitations which are important applications are obtained.
Received: 23.03.2007
Citation:
V. A. Amelkin, “Enumeration problems of oriented serial sequences”, Sib. Zh. Vychisl. Mat., 11:3 (2008), 271–282; Num. Anal. Appl., 1:3 (2008), 223–232
Linking options:
https://www.mathnet.ru/eng/sjvm47 https://www.mathnet.ru/eng/sjvm/v11/i3/p271
|
Statistics & downloads: |
Abstract page: | 232 | Full-text PDF : | 70 | References: | 31 | First page: | 1 |
|