| 一类广义格路的计数 |
| |
| 引用本文： | 唐保祥,任韩.一类广义格路的计数[J].吉首大学学报(自然科学版),2013,34(2):1-4. |
| |
| 作者姓名： | 唐保祥 任韩 |
| |
| 作者单位： | (1.天水师范学院数学与统计学院，甘肃 天水 741001;2.华东师范大学数学系，上海 200062) |
| |
| 基金项目： | 国家自然科学基金资助项目(11171114) |
| |
| 摘 要： | 连结m×n的棋盘上一对对角顶点的路称为广义格路.利用限位排列计数方法,得到m×n的棋盘上长为m+n+2的广义格路的计数公式.
|
| 关 键 词： | 棋盘 广义格路 字符序列 双射 |
Counting of One Kind of Generalized Lattice Path |
| |
| TANG Bao-xiang
,
REN Han.Counting of One Kind of Generalized Lattice Path[J].Journal of Jishou University(Natural Science Edition),2013,34(2):1-4. |
| |
| Authors: | TANG Bao-xiang REN Han |
| |
| Institution: | (1.School of Mathematics and Statistics,Tianshui Normal University,Tianshui 741001,Gansu China;2.Department of Mathematics,East China Normal University,Shanghai 200062,China) |
| |
| Abstract: | The generalized lattice path is made by joining path which is on a pair of diagonal vertices on the chessboard of m×n.The counting formula of the generalized lattice path whose length is m+n+2 on chessboard of m×n has been obtained by using the counting method of the spacing permutations. |
| |
| Keywords: | chessboard generalized lattice path character sequence bijection |
| 本文献已被 万方数据 等数据库收录！ |
| 点击此处可从《吉首大学学报(自然科学版)》浏览原始摘要信息 |
| 点击此处可从《吉首大学学报(自然科学版)》下载免费的PDF全文 |
