On cobweb posets and their combinatorially admissible sequences

dc.creatorKwasniewski, A. K.
dc.date2005-12-26
dc.date2009-01-19
dc.date.accessioned2026-07-07T12:31:19Z
dc.date.available2026-07-07T12:31:19Z
dc.descriptionThe 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.description16 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.identifierhttps://arxiv.org/abs/math/0512578
dc.identifierhttp://arxiv.org/abs/math/0512578
dc.identifierAdv. Studies Contemp. Math. Vol. 18 No 1, 2009 17-32
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/216405
dc.subjectCombinatorics
dc.subjectDiscrete Mathematics
dc.subject05C20, 11C08, 17B56
dc.titleOn cobweb posets and their combinatorially admissible sequences
dc.typetext

Files

Collections