| 一类组合计数问题 |
| |
| 引用本文： | 蒲和平.一类组合计数问题[J].电子科技大学学报(社会科学版),1997(3). |
| |
| 作者姓名： | 蒲和平 |
| |
| 作者单位： | 电子科技大学应用数学系 |
| |
| 摘 要： | 考察了满足一定限制条件的长度为ｎ具有ｍ个水平的数列计数问题，给出了它们的递归式和显表达式；改进了钥匙编码组合计数中的一个结果并得到几个组合恒等式
|
| 关 键 词： | 编码数 生成函数 递归式 显式 |
A Class of Combinatorial Counting Problems |
| |
| Pu,Heping.A Class of Combinatorial Counting Problems[J].Journal of University of Electronic Science and Technology of China(Social Sciences Edition),1997(3). |
| |
| Authors: | Pu Heping |
| |
| Abstract: | In this paper,soml problems of counting the n umber of m level digital sequlnces of length n that satisfy some constraints are considered and their recursive formulas and explicit formulations arl given.A result of combinatorial lnumlration of kly codlwords is improved and some combinatorial identical relations are got. |
| |
| Keywords: | coded number generating function recursive formula explicit formula |
| 本文献已被 CNKI 等数据库收录！ |
