6 citations · 7 across the 2 of their papers we have counts for
Showing math.GTShow all
2 papers · 1 filter
math.GT2016★ 6 cited
Ropelength, crossing number and finite type invariants of links
R. Komendarczyk, A. Michaelides
Ropelength and embedding thickness are related measures of geometric complexity of classical knots and links in Euclidean space. In their recent work, Freedman and Krushkal posed a…
math.GT2016★ 1 cited
Tree invariants and Milnor linking numbers with indeterminacy
R. Komendarczyk, A. Michaelides
The paper concerns the tree invariants of string links, introduced by Kravchenko and Polyak and closely related to the classical Milnor linking numbers also known as --invar…