Cobweb posets - Recent Results
From MaRDI portal
Publication:3514101
zbMATH Open1145.06001arXiv0801.3985MaRDI QIDQ3514101FDOQ3514101
Authors: Andrzej Krzysztof Kwaśniewski, Maciej Dziemiańczuk
Publication date: 21 July 2008
Abstract: 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 ([6,7] and references therein to the first author).[7,6,8] include natural enquires to be reported on here. The purpose of this presentation is to report on the progress in solving computational problems which are quite easily formulated for the new class of directed acyclic graphs interpreted as Hasse diagrams. The problems posed there and not yet all solved completely are of crucial importance for the vast class of new partially ordered sets with joint combinatorial interpretation. These so called cobweb posets - are relatives of Fibonacci tree and are labeled by specific number sequences - natural numbers sequence and Fibonacci sequence included. The cobweb posets might be identified with a chain of di-bicliques i.e. by definition - a chain of complete bipartite one direction digraphs [6]. Any chain of relations is therefore obtainable from the cobweb poset chain of complete relations via deleting arcs in di-bicliques of the complete relations chain. In particular we response to one of those problems [1].
Full work available at URL: https://arxiv.org/abs/0801.3985
Recommendations
- scientific article
- Some Cobweb posets digraphs -- elementary properties and questions
- On incidence algebras description of cobweb posets
- On Characteristic Polynomials of the Family of Cobweb Posets
- Webs and posets
- Cobweb posets as noncommutative prefabs
- On Cobweb posets tiling problem
- scientific article; zbMATH DE number 2246640
- Reduced incidence algebras description of cobweb posets and KoDAGs
- scientific article; zbMATH DE number 7157680
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Combinatorics of partially ordered sets (06A07) Fibonacci and Lucas numbers and polynomials and generalizations (11B39)
Cited In (11)
- Webs and posets
- On incidence algebras description of cobweb posets
- On Cobweb posets tiling problem
- Prefab posets' Whitney numbers
- On Characteristic Polynomials of the Family of Cobweb Posets
- Cobweb posets as noncommutative prefabs
- Some Cobweb posets digraphs -- elementary properties and questions
- First observations on prefab posets' Whitney numbers
- Reduced incidence algebras description of cobweb posets and KoDAGs
- Title not available (Why is that?)
- Cobweb posets and KoDAG digraphs are representing natural join of relations, their di-bigraphs and the corresponding adjacency matrices
This page was built for publication: Cobweb posets - Recent Results
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3514101)