On cobweb posets and their combinatorially admissible sequences

TL;DR

This paper introduces three elementary problems related to cobweb posets and their admissible sequences, highlighting unresolved issues in the combinatorial structure of these partially ordered sets.

Contribution

It formulates three new, elementary problems in the study of cobweb posets, emphasizing their importance and current lack of solutions.

Findings

Problems are easy to formulate but remain unsolved.

Highlights significance of cobweb posets in combinatorics.

Encourages further research into these open problems.

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.