| 矩形棋盘上完全覆盖的计数 |
| |
| 引用本文： | 梁登星,王娟. 矩形棋盘上完全覆盖的计数[J]. 淮阴师范学院学报(自然科学版), 2012, 0(2): 134-136 |
| |
| 作者姓名： | 梁登星 王娟 |
| |
| 作者单位： | 成都理工大学管理科学学院 |
| |
| 摘 要： | 研究矩形棋盘上的1×2骨牌覆盖问题,通过生成函数的方法,分别给出3×n,4×n矩形棋盘上的覆盖数N(3,n),N(4,n)的生成函数.
|
| 关 键 词： | 完全覆盖 递推关系 生成函数 |
Enumeration of Perfect Cover in the Rectangular Chessboard |
| |
| LIANG Deng-xing,WANG Juan. Enumeration of Perfect Cover in the Rectangular Chessboard[J]. Journal of Huaiyin Teachers College(Natrual Science Edition), 2012, 0(2): 134-136 |
| |
| Authors: | LIANG Deng-xing WANG Juan |
| |
| Affiliation: | (College of Management Science,Chengdu University of Technology,Chengdu Sichuan 610059,China) |
| |
| Abstract: | Based on the method of generating function theory,the paper analyzes the problem of perfect cover of rectangular chessboard and gets the generating function of N(3,n) and N(4,n). |
| |
| Keywords: | perfect cover recurrence relations generating function |
| 本文献已被 CNKI 等数据库收录！ |
|
