Cobweb posets-Recent Results
1
조회
0
다운로드
2
인용
0
참고문헌
키워드
초록
Cobweb posets uniquely represented by directed acyclic graphs are such a generaliza- tion 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 ¯rst 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 speci¯c number sequences - natural numbers sequence and Fibonacci sequence included. One presents here also a join combinatorial interpretation of those posets` F-nomial coe±cients which are computed with the so called cobweb admissible sequences. Cobweb posets and their natural subposets are graded posets. They are vertex partitioned into such antichains ©n (where n is a nonnegative integer) that for each ©n, all of the elements covering x are in ©n+1 and all the elements covered by x are in ©n. We shall call the ©n the n ¡ th- level. The cobweb posets might be identi¯ed with a chain of di-bicliques i.e. by de¯nition - 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]. This is a tiling problem. Our information on tiling prob- lem refers on proofs of tiling's existence for some cobweb-admissible sequences as in [1]. There the second author shows that not all cobwebs admit tiling as de¯ned below and provides examples of cobwebs admitting tiling.
Abstract
Cobweb posets uniquely represented by directed acyclic graphs are such a generaliza- tion 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 ¯rst 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 speci¯c number sequences - natural numbers sequence and Fibonacci sequence included. One presents here also a join combinatorial interpretation of those posets` F-nomial coe±cients which are computed with the so called cobweb admissible sequences. Cobweb posets and their natural subposets are graded posets. They are vertex partitioned into such antichains ©n (where n is a nonnegative integer) that for each ©n, all of the elements covering x are in ©n+1 and all the elements covered by x are in ©n. We shall call the ©n the n ¡ th- level. The cobweb posets might be identi¯ed with a chain of di-bicliques i.e. by de¯nition - 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]. This is a tiling problem. Our information on tiling prob- lem refers on proofs of tiling's existence for some cobweb-admissible sequences as in [1]. There the second author shows that not all cobwebs admit tiling as de¯ned below and provides examples of cobwebs admitting tiling.
참고문헌 (18)
- M. Dziemianczuk, "On cobweb posets tiling problem, arXiv" (2007), math.Co
- Charles Jordan, "On Stirling Numbers Thoku", Math. J, 37, pp.254~278 (1933)
- J. Konvalina, "A Uni¯ed Interpretation of the Binomial Coe±cients", the Stir- ling Numbers and the Gaussian Coe±cients The American Mathematical Monthly, 107, pp.901~910 (2000)
- E. Krot, "An Introduction to Finite Fibonomial Calculus", CEJM, 2(5), pp.754~766 (2005)
- E. Krot, "The ¯rst ascent into the Fibonacci Cob-web Poset", Adv. Stud. Contemp. Math, 11(2), pp.179~184 (2007)
- A.K. Kwa¶sniewski, "On cobweb posets and their combinatorially admissible sequences, arXiv : math:CO=0512578", ~ (2007)
- A. K. Kwasniewski, "Cobweb posets as noncommutative prefabs", Advanced Studies in Contemporary Mathematics, 14(1), pp.37~47 (2007), 장전수학회(章田數學會)
- A.K. Kwa¶sniewski, "First observations on Prefab posets' Whitney numbers Ad- vances in Applied Cli®ord Algebras" (2007), Springer Link Date
- A.K. Kwa¶sniewski, "On extended ¯nite operator calculus of Rota and quantum groups Integral", Transforms and Special Functions, 2(4), pp.333~340 (2001)
- A.K. Kwa¶sniewski, "Main theorems of extended ¯nite operator calculus", Integral Transforms and Special Functions, 14(6), pp.499~516 (2003)
- A.K. Kwa¶sniewski, "The logarithmic Fib-binomial formula", Advanced Stud. Con-temp. Math, 9(1), pp.19~26 (2004)
- A.K. Kwa¶sniewski, "Fibonomial cumulative connection constants", Bulletin of the ICA, 44, pp.81~ (2005)
- A.K. Kwa¶sniewski, "On umbral extensions of Stirling numbers and Dobinski- like formulas Advanced Stud", Contemp. Math, 12(1), pp.73~100 (2006)
- Anatoly D. Plotnikov, "About presentation of a digraph by dim 2 poset", Adv. Stud. Contemp. Math, 12(1), pp.55~60 (2006)
- "Sagan Mobius Functions of Posets (Lisbon lectures)IV: Why the Char-acteristic Polynomial factors"[URL]
- E. Spiegel, "Incidence algebras" (1997), Marcel Dekker, Inc.
- Richard P. Stanley, "Hyperplane Arrangements", Proc. Nat. Acad. Sci., pp.2620~2625 (1996)
- M. Ward, "A calculus of sequences", Amer.J.Math, 58, pp.255~266 (1936)