Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Research
Estimates on the semi-meandric crossing number of classical knots. / Belousov, Yury ; Malyutin, Andrei .
Polynomial Computer Algebra '2017: The International Conference. СПб. : Издательство «ВВМ», 2017. p. 21-23.Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Research
}
TY - GEN
T1 - Estimates on the semi-meandric crossing number of classical knots
AU - Belousov, Yury
AU - Malyutin, Andrei
N1 - Yu. Belousov, A. Malyutin. Estimates on the semi-meandric crossing number of classical knots // Abstracts of The International Conference "Polynomial Computer Algebra" '2017. — 2017. — P. 21-23.
PY - 2017
Y1 - 2017
N2 - A plane diagram D of a knot is said to be semi-meandric if D is the union of two simple smooth arcs. Every tame knot has a semi-meandric diagram. We use this fact to define a new knot invariant: the semi-meandric crossing number. Applying the technique of Gauss Codes and a specific algo- rithm transforming arbitrary knot diagrams to semi-meandric ones we obtain estimates on this invariant.
AB - A plane diagram D of a knot is said to be semi-meandric if D is the union of two simple smooth arcs. Every tame knot has a semi-meandric diagram. We use this fact to define a new knot invariant: the semi-meandric crossing number. Applying the technique of Gauss Codes and a specific algo- rithm transforming arbitrary knot diagrams to semi-meandric ones we obtain estimates on this invariant.
UR - http://pca.pdmi.ras.ru/2017/
UR - http://pca.pdmi.ras.ru/2017/abstract_files/pca_Belousov.pdf
UR - https://www.elibrary.ru/item.asp?id=42652227&pff=1
M3 - Conference contribution
SN - 978-5-9651-1057-5
SP - 21
EP - 23
BT - Polynomial Computer Algebra '2017
PB - Издательство «ВВМ»
CY - СПб.
Y2 - 17 April 2017 through 22 April 2017
ER -
ID: 15680871