50 citations · 125 across the 28 of their papers we have counts for
Showing 2018Show all
2 papers · 1 filter
math.GT2018
The unbearable hardness of unknotting
Arnaud de Mesmay, Yo'av Rieck, Eric Sedgwick +1
We prove that deciding if a diagram of the unknot can be untangled using at most Riedemeister moves (where is part of the input) is NP-hard. We also prove that several natu…
math.CO2018★ 4 cited
On the growth of the Möbius function of permutations
Vít Jelínek, Ida Kantor, Jan Kynčl +1
We study the values of the Möbius function of intervals in the containment poset of permutations. We construct a sequence of permutations of size for which $μ(1,π_…