Abstract:In connection with Vassiliev's knot invariants, Stoimenow introduced in 1998 a class of matchings, also known as regular linearized chord diagrams. These matchings are linked to various combinatorial structures, all of which are associated with the Fishburn numbers. In this paper, we address a problem posed by Bevan et al.\ in 2025 concerning the identification of subsets of Stoimenow matchings that are counted by the Catalan numbers. We present five solutions in terms of pattern-avoiding matchings. We also consider four infinite families of patterns that generalize four of the five forbidden patterns appearing in the solution to the problem we solved and prove that the matchings avoiding them are equinumerous. Finally, we establish numerous results on distributions and joint equidistribution of statistics over these Catalan-counted subsets of Fishburn structures, namely Stoimenow matchings, $(2+2)$-free posets, ascent sequences, and Fishburn permutations, notably expressing some of them in terms of Narayana numbers and others in terms of ballot numbers.
From: Philip B. Zhang [view email]
[v1]
Thu, 11 Sep 2025 02:52:32 UTC (31 KB)
[v2]
Sun, 5 Jul 2026 21:22:34 UTC (31 KB)
此内容由惯性聚合(RSS阅读器)自动聚合整理，仅供阅读参考。 原文来自 — 版权归原作者所有。