On cobweb posets and their combinatorially admissible sequences
arXiv:math/0512578
Abstract
The main purpose of this article is to pose three problems which are easy to be formulated in an elementary way. These problems which are specifically important also for the new class of partially ordered sets seem to be not yet solved.
16 pages, 9 figures, affiliated to The Internet Gian Carlo Rota Polish Seminar: 16 pages, 9 figures, affiliated to The Internet Gian Carlo Rota Polish Seminar http://ii.uwb.edu.pl/akk/sem/sem_rota.htm
References in corpus (2)
Cited by in corpus (17)
- Cobweb posets - Recent Results
- Fibonomial cumulative connection constants
- On incidence algebras description of cobweb posets
- On Cobweb Posets and Discrete F-Boxes Tilings
- On cobweb posets most relevant codings
- On GCD-morphic sequences
- Reduced Incidence algebras description of cobweb posets and KoDAGs
- How the work of Gian Carlo Rota had influenced my group research and life
- On Characteristic Polynomials of the Family of Cobweb Posets
- Graded posets inverse zeta matrix formula
- Counting Bipartite, k-Colored and Directed Acyclic Multi Graphs Through F-nomial coefficients
- Generalization of Fibonomial Coefficients
- Cobweb Posets and KoDAG Digraphs are Representing Natural Join of Relations, their diBigraphs and the Corresponding Adjacency Matrices
- On natural join of posets properties and first applications
- Natural join construction of graded posets versus ordinal sum and discrete hyper boxes
- On compositions of numbers and graphs
- Note on Ward-Horadam H(x) - binomials' recurrences and related interpretations, II