On Cobweb posets tiling problem

MaRDI QIDQ3514102zbMATH OpenFDO

Authors Maciej Dziemiańczuk

Publication date 21 July 2008

Full work available at URL https://arxiv.org/abs/0709.4263

zbMATH Keywords

tilingsacyclic digraphscobwebsspecial number sequencesbinomial-like coefficientscobweb-admissible sequences

Mathematics Subject Classification ID

Combinatorial aspects of tessellation and tiling problems (05B45)

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.

Recommendations

• Cobweb posets - Recent Results
• scientific article; zbMATH DE number 5548720
• On Characteristic Polynomials of the Family of Cobweb Posets
• scientific article; zbMATH DE number 2246640
• On incidence algebras description of cobweb posets

Cited in

(4)

• On Characteristic Polynomials of the Family of Cobweb Posets
• scientific article; zbMATH DE number 5548720 (Why is no real title available?)
• Almost tiling of the Boolean lattice with copies of a poset
• Cobweb posets - Recent Results

This page was built for publication: On Cobweb posets tiling problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3514102)