






















The present paper is concerned with the enumeration of the state diagrams for some classes of knot shadows endowed with the usual connected sum operation. We focus on shadows that are recursively generated by knot shadows with up to 3 crossings, and for which the enumeration problem is solved with the help of generating polynomials.
此内容由惯性聚合(RSS阅读器)自动聚合整理,仅供阅读参考。 原文来自 — 版权归原作者所有。