{'fraction_non_alphanumeric': 0.025236593059936908, 'fraction_numerical': 0.006309148264984227, 'mean_word_length': 4.825688073394495, '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}}
Some statistics on permutations avoiding generalized patterns

In the last decade a huge amount of articles has been published study- ing pattern avoidance on permutations. From the point of view of enumeration, typically one tries to count permutations avoiding certain patterns according to their lengths. Here we tackle the problem of refining this enumeration by con- sidering the statistics "first/last entry". We give results for at least one of the mentioned statistics for every generalized patterns of type (1, 2) or (2, 1) as well as for some cases of permutations avoiding a pair of generalized patterns of the above types.