2022/03/05 by Olavi Äikäs, Äikäs, Olavi, Uli Fahrenberg +5
Computer Science · Mathematics · #Advanced Combinatorial Mathematics #Combinatorics (math.CO) #FOS: Mathematics #Polynomial and algebraic computation #semigroups and automata theory
paper · pdf · doi:10.48550/arxiv.2203.02695
openalex publication_date 2022/03/05 · openalex created_date 2022/05/05 · openalex updated_date 2026/07/28
We generate and count isomorphism classes of gluing-parallel posets with interfaces (iposets) on up to eight points, and on up to ten points with interfaces removed. In order to do so, we introduce a new class of iposets with full interfaces and show that considering these is sufficient. We also describe the software (written in Julia) that we have used for our exploration and define a new incomplete isomorphism invariant which may be computed in polynomial time yet identifies only very few pairs of non-isomorphic iposets.