A recursive approach for the determination of the nice sections of width three which have a 4-crown stack as retract
Year: 2025
Type: preprint
Abstract: The characterization of the finite minimal automorphic posets of width three is still an open problem. Niederle has shown that this task can be reduced to the characterization of the nice sections of width three which have a non-trivial tower of nice sections as retract. In our article, we develop a recursive approach for the determination of those nice sections of width three which have a 4-crown stack as retract. We apply the approach on a sub-class $\mathfrak{N}_2$ of nice sections of width three and determine all posets in $\mathfrak{N}_2$ with height up to six which have a 4-crown stack as retract. For each integer $n \geq 2$, the class $\mathfrak{N}_2$ contains $2^{n-2}$ different isomorphism types of posets of height $n$.
Source: arXiv (Cornell University)
Author: Campo, Frank a
Language: English
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W4414977921
Cites:
Cited by:
Related to: