On cobweb posets and their combinatorially admissible sequences
| dc.creator | Kwasniewski, A. K. | |
| dc.date | 2005-12-26 | |
| dc.date | 2009-01-19 | |
| dc.date.accessioned | 2026-07-07T12:31:19Z | |
| dc.date.available | 2026-07-07T12:31:19Z | |
| dc.description | 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. | |
| dc.description | 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 | |
| dc.identifier | https://arxiv.org/abs/math/0512578 | |
| dc.identifier | http://arxiv.org/abs/math/0512578 | |
| dc.identifier | Adv. Studies Contemp. Math. Vol. 18 No 1, 2009 17-32 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/216405 | |
| dc.subject | Combinatorics | |
| dc.subject | Discrete Mathematics | |
| dc.subject | 05C20, 11C08, 17B56 | |
| dc.title | On cobweb posets and their combinatorially admissible sequences | |
| dc.type | text |