{'fraction_non_alphanumeric': 0.02837837837837838, 'fraction_numerical': 0.005405405405405406, 'mean_word_length': 5.279661016949152, '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': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
An Euler‐genus approach to the calculation of the crosscap‐number polynomial

In 1994, J. Chen, J. Gross, and R. Rieper demonstrated how to use the rank of Mohar's overlap matrix to calculate the crosscap‐number distribution, that is, the distribution of the embeddings of a graph in the nonorientable surfaces. That has ever since been by far the most frequent way that these distributions have been calculated. This article introduces a way to calculate the Euler‐genus polynomial of a graph, which combines the orientable and the nonorientable embeddings, without using the overlap matrix. The crosscap‐number polynomial for the nonorientable embeddings is then easily calculated from the Euler‐genus polynomial and the genus polynomial.