<p>In this paper, we propose an algorithm for enumerating and calculating compositions of a natural number based on combinatorial objects of a hierarchical structure, such as the Pascal triangle, the Pascal pyramid, and the Pascal hyperpyramids. We obtain a recurrent relation that is the basis for enumerating and calculating compositions of a natural number with an arbitrary constraints on the values of its natural parts and the formula for explicit calculating compositions and a generating function for the number of compositions.</p>

错误:搜索内容不能为空,请输入英文关键词
错误:关键词超出字数限制,请精简
高级检索

COMBINATORIAL ALGORITHM FOR ENUMERATING AND CALCULATING COMPOSITIONS OF NATURAL NUMBERS WITH CONSTRAINTS

  • O. Kuzmin,
  • M. Strikhar

摘要

In this paper, we propose an algorithm for enumerating and calculating compositions of a natural number based on combinatorial objects of a hierarchical structure, such as the Pascal triangle, the Pascal pyramid, and the Pascal hyperpyramids. We obtain a recurrent relation that is the basis for enumerating and calculating compositions of a natural number with an arbitrary constraints on the values of its natural parts and the formula for explicit calculating compositions and a generating function for the number of compositions.