# Cobweb posets as noncommutative prefabs

Source: [Cobweb posets as noncommutative prefabs](<https://www.sota2.com/research/paper/68fa4dd21e209131ce957746>)

Collection index: [llms.txt](<https://www.sota2.com/research/llms.txt>)

Data updated: 2025-10-25T09:30:52.323Z

Authors: A.K.Kwasniewski

Published: 2005-03-15T04:26:45.000Z

## Abstract

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.

## Recorded benchmark results

A research result applies to its stated dataset, split, metric and evaluation configuration. Compare like-for-like settings, preserve the metric's unit and direction, and distinguish paper-reported results from independent reproduction. The best result recorded here is not a claim of exhaustive, current global coverage.

## Original sources and implementation

[Original paper](<https://arxiv.org/abs/math/0503286>)

[PDF](<https://arxiv.org/pdf/math/0503286.pdf>)
