On Cobweb posets tiling problem

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.

15 pages, 15 figures

References in corpus (1)

• Cobweb posets as noncommutative prefabs

Cited by in corpus (10)

• Cobweb posets - Recent Results
• On Cobweb Posets and Discrete F-Boxes Tilings
• On cobweb posets most relevant codings
• On multi F-nomial coefficients and Inversion formula for F-nomial coefficients
• Counting Bipartite, k-Colored and Directed Acyclic Multi Graphs Through F-nomial coefficients
• Graded posets inverse zeta matrix formula
• Natural join construction of graded posets versus ordinal sum and discrete hyper boxes
• On natural join of posets properties and first applications
• Note on Ward-Horadam H(x) - binomials' recurrences and related interpretations, II
• On Cobweb Admissible Sequences - The Production Theorem