Cobweb posets as noncommutative prefabs
| dc.creator | Kwasniewski, A. K. | |
| dc.date | 2005-03-15 | |
| dc.date | 2005-09-25 | |
| dc.date.accessioned | 2026-07-07T09:19:28Z | |
| dc.date.available | 2026-07-07T09:19:28Z | |
| dc.description | A class of new type graded infinite posets with minimal element are considered. These so called cobweb posets introduced recently by the present author provide a wide range of new noncommutative prefab combinatorial schema with characteristic graded subposets as primes. The schema are defined here via relaxing commutativity and associativity requirements imposed on the composition of prefabs by the fathers of this fertile concept. The construction and the very first basic properties of cobweb prefabs are pointed out in what follows. An another single valued commutative amd associative composision is also considered. | |
| dc.description | 11 pages, 5 figures | |
| dc.identifier | https://arxiv.org/abs/math/0503286 | |
| dc.identifier | http://arxiv.org/abs/math/0503286 | |
| dc.identifier | Adv. Stud. Contemp. Math. vol. 14 (1) 2007. pp. 37-47 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/154402 | |
| dc.subject | Combinatorics | |
| dc.subject | Discrete Mathematics | |
| dc.subject | 05C20, 11C08, 17B56 | |
| dc.title | Cobweb posets as noncommutative prefabs | |
| dc.type | text |