{'fraction_non_alphanumeric': 0.030364372469635626, 'fraction_numerical': 0.0020242914979757085, 'mean_word_length': 4.556179775280899, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 1, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
The Enhanced Linking Number

The simplest of questions that arise in the study of links turn out to be the most difficult. Perhaps the most immediate of these questions is whether there exists a computable method for determining equivalence among links. After all, it seems intuitive that such a method should exist. While no such method is currently known, we can at least, in some cases, conclude that two links are inequivalent. In this paper we will explore some properties of the enhanced linking number and its relation to the standard linking number, and how they relate to this fundamental question. 1 The Conway Polynomial In this section we see how the Conway polynomial is used to construct the enhanced linking number function, from which we derive a defining relation. The Conway polynomial C(z) is a polynomial in one variable (conventionally z). It is succinctly defined by the following relations (the first relation is called a skein relation): C ( ) − C ( ) = zC ( ) (1)