论文标题
毫无开关的周期
Unknotted cycles
论文作者
论文摘要
指出置换的周期图在视觉上类似于用于描绘拓扑结中的结和链接的网格图，我们考虑了从排列的循环图获得的结（或链接）。我们表明，以这种方式对应于Unnyne的排列被Schröder数字列举，并且还列举了与Unlink相对应的排列。证明使用本纳金的不平等。
Noting that cycle diagrams of permutations visually resemble grid diagrams used to depict knots and links in topology, we consider the knot (or link) obtained from the cycle diagram of a permutation. We show that the permutations which correspond in this way to an unknot are enumerated by the Schröder numbers, and also enumerate the permutations corresponding to an unlink. The proof uses Bennequin's inequality.
