|
Zapiski Nauchnykh Seminarov POMI, 2017, Volume 464, Pages 77–87
(Mi znsl6522)
|
|
|
|
This article is cited in 2 scientific papers (total in 2 papers)
Counting unlabelled chord diagrams of maximal genus
E. C. Krasko St. Petersburg Academic University, St. Petersburg, Russia
Abstract:
Maximal chord diagrams up to all isomorphisms are enumerated. The enumerating formula is based on a bijection between rooted one-vertex one-face maps on locally orientable surfaces and a certain class of symmetric chord diagrams. This result extends the one of Cori and Marcus regarding maximal chord diagrams enumerated up to rotations.
Key words and phrases:
chord diagrams, maps on surfaces, unlabelled enumeration.
Received: 09.11.2017
Citation:
E. C. Krasko, “Counting unlabelled chord diagrams of maximal genus”, Combinatorics and graph theory. Part IX, Zap. Nauchn. Sem. POMI, 464, POMI, St. Petersburg, 2017, 77–87; J. Math. Sci. (N. Y.), 236:5 (2019), 521–526
Linking options:
https://www.mathnet.ru/eng/znsl6522 https://www.mathnet.ru/eng/znsl/v464/p77
|
Statistics & downloads: |
Abstract page: | 104 | Full-text PDF : | 40 | References: | 32 |
|