Full-Text Search:
Home|Journal Papers|About CNKI|User Service|FAQ|Contact Us|中文
《Journal of ZhangZhou Teachers College》 1995-02
Add to Favorite Get Latest Update

Enumeration of Coverings of Labeled Rectangles by 1×k Rectangles

Chen Xiebin(Dept. of Math. )  
Let 1≤r≤k- 1, 0≤t≤k- 1, Rk+r, nk + t denotes the labeled (k+r) ×(nk + t ) rectangle.If t0, it is proved that Rk+r,nk + t can't be covered by 1×k or k×1 rectangles.Let f (k, r, n ) be the number of the coverings of Rk+r, nk by 1 ×k or k×1 rectangles, F (k, r, x ) be the generating function for the sequence { f (k, r, n ) }, we show that which generalizes the result of Tomescu [ 2, 3 ]
【CateGory Index】: O151.2
Download(CAJ format) Download(PDF format)
CAJViewer7.0 supports all the CNKI file formats; AdobeReader only supports the PDF format.
©2006 Tsinghua Tongfang Knowledge Network Technology Co., Ltd.(Beijing)(TTKN) All rights reserved