On Cobweb posets tiling problem
From MaRDI portal
Publication:3514102
zbMATH Open1144.05307arXiv0709.4263MaRDI QIDQ3514102
Publication date: 21 July 2008
Abstract: Kwasniewski's cobweb posets uniquely represented by directed acyclic graphs are such a generalization of the Fibonacci tree that allows joint combinatorial interpretation for all of them under admissibility condition. This interpretation was derived in the source papers and it entailes natural enquieres already formulated therein. In our note we response to one of those problems. This is a tiling problem. Our observations on tiling problem include proofs of tiling's existence for some cobweb-admissible sequences. We show also that not all cobwebs admit tiling as defined below.
Full work available at URL: https://arxiv.org/abs/0709.4263
tilingsacyclic digraphscobwebsspecial number sequencesbinomial-like coefficientscobweb-admissible sequences
This page was built for publication: On Cobweb posets tiling problem
