首页 | 本学科首页   官方微博 | 高级检索  
     检索      


Solving enumeration problems for serial sequences with a constant difference in adjacent series heights
Authors:V A Amelkin
Institution:1. Institute of Computational Mathematics and Mathematical Geophysics, Siberian Branch, Russian Academy of Sciences, pr. Akad. Lavrent??eva 6, Novosibirsk, 630090, Russia
Abstract:In this paper, the sets of n-valued 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 is solved for the sets of ascending, descending, and one-transitive sequences with constant differences in the adjacent series heights.
Keywords:
本文献已被 SpringerLink 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号