{'fraction_non_alphanumeric': 0.0548885077186964, 'fraction_numerical': 0.005145797598627788, 'mean_word_length': 4.0344827586206895, '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 upper bound for the determinant of a matrix with given entry sum and square sum.

By deducing characterisations of the matrices which have maximal determinant in the set of matrices with given entry sum and square sum, we prove the inequality |det M | ≤ |α|(β − δ)(n−1)/2 for realn × n-matricesM , wherenα andnβ are the sum of the entries and the sum of the squared entries of M , respectively, andδ := (α − β)/(n − 1), provided that α ≥ β. This result is applied to find an upper bound for the determinant of a matrix whose entries are a permutation of an arithmetic progression.