On Cobweb Admissible Sequences - The Production Theorem

MaRDI QIDQ6208257zbMATH OpenFDO

Authors Maciej Dziemiańczuk

Publication date 30 January 2008

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Structural characterization of families of graphs (05C75) Combinatorics of partially ordered sets (06A07) Fibonacci and Lucas numbers and polynomials and generalizations (11B39)

Abstract: In this note further clue decisive observations on cobweb admissible sequences are shared with the audience. In particular an announced proof of the Theorem 1 (by Dziemia'nczuk) from [1] announced in India -Kolkata- December 2007 is delivered here. Namely here and there we claim that any cobweb admissible sequence F is at the point product of primary cobweb admissible sequences taking values one and/or certain power of an appropriate primary number p. Here also an algorithm to produce the family of all cobweb-admissible sequences i.e. the Problem 1 from [1] i.e. one of several problems posed in source papers [2,3] is solved using the idea and methods implicitly present already in [4]

This page was built for publication: On Cobweb Admissible Sequences - The Production Theorem

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