# On cobweb posets and their combinatorially admissible sequences

Source: [On cobweb posets and their combinatorially admissible sequences](<https://www.sota2.com/research/paper/68fa4e131e209131ce9593e9>)

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

Data updated: 2025-10-25T09:37:51.379Z

Authors: A. K. Kwasniewski

Published: 2005-12-26T20:12:57.000Z

## 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.

## 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/0512578>)

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