Enumeration of chord diagrams

Simple item page
dc.creatorKhruzin, Andrei
dc.date2000-08-28
dc.date.accessioned2026-07-07T04:37:01Z
dc.date.available2026-07-07T04:37:01Z
dc.descriptionWe determine the number of nonequivalent chord diagrams of order $n$ under the action of two groups, $C_{2n}$, a cyclic group of order $2n$, and $D_{2n}$, a dihedral group of order $4n$. Asymptotic formulas are also established.
dc.description10 pages, Latex, uses PSTricks
dc.identifierhttps://arxiv.org/abs/math/0008209
dc.identifierhttp://arxiv.org/abs/math/0008209
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/59808
dc.subjectCombinatorics
dc.subjectQuantum Algebra
dc.subject05A15; 05C25
dc.titleEnumeration of chord diagrams
dc.typetext

Files

Collections

arXiv