初文昌.关于无K—间隔的组合数[J].数学研究及应用,1987,7(3):511~520 |
关于无K—间隔的组合数 |
On the Number of Combinat ions Without k-Separat ions |
投稿时间:1985-08-10 |
DOI:10.3770/j.issn:1000-341X.1987.03.030 |
中文关键词: |
英文关键词: |
基金项目: |
|
摘要点击次数: 2086 |
全文下载次数: 1008 |
中文摘要: |
|
英文摘要: |
Let fk(n, m) denote the number of ways of selecting m objects from n objects arrayed in a line with no two selected having k-spparations (i.e., having exactly k-objects between them) .If the objects are arranged in a circle, the corresponding number is denoted by gk(n, m) . Kaplansky first published a derivation by recurrence relation for k - 0. Recently, Konvalina derived the enumerative formulae for k =1 by using the similar method . For a general k, this problem is somehow more difficult and complicated. |
查看全文 查看/发表评论 下载PDF阅读器 |
|
|
|