In this note, we provide a (super-exponential time) algorithm to solve the generalized conjugacy problem in relatively hyperbolic groups, given solvability of the generalized conjugacy problem in each of the parabolic subgroups.
We provide an algorithm to determine whether a link L admits a crossing change that turns it into a split link, under some fairly mild hypotheses on L . The algorithm also provides a complete list of all such crossing changes. It can therefore also determine whether the unlinking number of L is 1.
In this paper, the flashlight (FL) algorithm, which is categorized as a heuristic method, has been suggested to determine the ultimate pit limit (UPL). In order to apply the suggested algorithm and other common algorithms, such as the dynamic programming, the Korobov, and the floating cone, and to validate the capability of the proposed method, the...