Ewa Krot
The characterization of fibonacci cobweb poset as d.a.g. and o.d.a.g. is given. The dim 2 poset such that its hasse diagram coincide with digraf of fibonacci cobweb poset is constructed.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
继续探索
The characterization of the large family of cobweb posets as DAGs and oDAGs is given. The dim 2 poset such that its Hasse diagram coincide with digraf of arbitrary cobweb poset is constructed.
The explicite formulas for möbiusien function and some other important elements of the incidence algebra are delivered. For that to do one uses kwaśniewski's construction of his fibonacci cobweb poset in the plane grid coordinate system.
The explicit formula for mobiusien function of fibonacci cobweb poset P is given for the first time by the use of definition of P in plane grid coordinate system.
In recent Kwasniewski's papers inspired by O. V. Viskov it was shown that the $ψ$-calculus in parts appears to be almost automatic, natural extension of classical operator calculus of Rota - Mullin or equivalently - of umbral calculus of Roman and Rota. At the same time this calculus is an example of the algebraization of the analysis - here restricted to the algebra of polynomials. The first part of the article is the review of the recent author's contribution. The main definitions and theorems of Finite Fibonomial Operator Calculus which is a special case of $ψ$-extented Rota's finite operat…
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 …
Primary definitions, notation and general observations of finite fibonomial operator calculus (ffoc) are presented. Kwasniewski's combinatorial interpretation of fibonomial coefficients by the use of fibonacci cobweb poset is given. Some elements of incidence algebra of fibonacci cobweb poset are defined.
We introduce a natural partial order in structurally natural finite subsets of the cobweb prefabs sets recently constructed by the present author. Whitney numbers of the second kind of the corresponding subposet which constitute Stirling like numbers triangular array are then calculated and the explicit formula for them is provided. Next, in the second construction we endow the set sums of prefabiants with such an another partial order that their Bell like numbers include Fibonacci triad sequences introduced recently by the present author in order to extend famous relation between binomial New…
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.
Natural join of $di-bigraphs$ that is directed biparted graphs and their corresponding adjacency matrices is defined and then applied to investigate the so called cobweb posets and their $Hasse$ digraphs called $KoDAGs$. $KoDAGs$ are special orderable directed acyclic graphs which are cover relation digraphs of cobweb posets introduced by the author few years ago. $KoDAGs$ appear to be distinguished family of $Ferrers$ digraphs which are natural join of a corresponding ordering chain of one direction directed cliques called $di-bicliques$. These digraphs serve to represent faithfully correspon…
F-boxes defined in [6] as hyper-boxes in N^{\infty} discrete space were applied here for the geometric description of the cobweb posetes Hasse diagrams tilings. The F-boxes edges sizes are taken to be values of terms of natural numbers' valued sequence F. The problem of partitions of hyper-boxes represented by graphs into blocks of special form is considered and these are to be called F-tilings. The proof of such tilings' existence for certain sub-family of admissible sequences F is delivered. The family of F-tilings which we consider here includes among others F = Natural numbers, Fibonacci n…
The notion of the Fibonacci cobweb poset from [1] has been naturally extended to any admissible sequence $F$ in [2] where it was also recognized that the celebrated prefab notion of Bender and Goldman [3] - (see also [4,5]) - admits such an extension so as to encompass the new type combinatorial objects from [2] as leading examples. Recently the present author had introduced also [6] two natural partial orders in there: one $\leq$ in grading-natural subsets of cobweb`s prefabs sets [2] and in the second proposal one endows the set sums of the so called "prefabiants" with such another partial o…
We introduce a natural partial order in structurally natural finite subsets the cobweb prefabs sets recently constructed by the present author. Whitney numbers of the second kind of the corresponding subposet which constitute Stirling-like numbers` triangular array are then calculated and the explicit formula for them is provided. Next - in the second construction - we endow the set sums of prefabiants with such an another partial order that their their bell like numbers include fibonacci triad sequences introduced recently by the present author in order to extend famous relation between binom…
扫码添加微信好友，提出您的宝贵建议 👇
💡 备注请填写：网站反馈
发表机构由 AI 从论文文本抽取，如发现错误，欢迎反馈修正建议。