{'fraction_non_alphanumeric': 0.031710079275198186, 'fraction_numerical': 0.06002265005662514, 'mean_word_length': 4.777777777777778, '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}}
Hadamard difference sets and related combinatorial objects in groups of order 144

In this paper we address an appealing and so far not completed combinatorial problem of difference set (DS) existence in groups of order 144. We apply our recently established method for DS construction which proves to be very efficient. The result is more than 5000 inequivalent (144, 66, 30) DSes obtained in 131 groups of order 144. The number of nonisomorphic symmetric designs rising from them is 1364. Using the obtained DSes as a source, new regular (144, 66, 30, 30) and (144, 65, 28, 30) partial difference sets are constructed, together with the corresponding strongly regular graphs. 43 non-isomorphic graphs of valency 66 are obtained and 78 of valency 65. The full automorphism groups of these graphs, as well as those of symmetric designs, are explored using the software package Magma.