{'fraction_non_alphanumeric': 0.02552415679124886, 'fraction_numerical': 0.0036463081130355514, 'mean_word_length': 5.203389830508475, '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}}
The optimal solutions to the continuous and discrete-time versions of the Hirschman uncertainty principle

We have previously developed an uncertainty measure that is suitable for finitely-supported (N samples) discrete-time signals. A specific instance of our measure has been termed the "discrete Hirschman (1957) uncertainty principal" in the literature, and we have adopted this terminology for our more general measure. We compare the optimal signals of this discrete version to the already determined optimal signals of the (continuous-time) Hirschman uncertainty principal. From our comparison, we conclude that a basic premise in signal processing, that if we sample densely enough, the discrete-time case directly corresponds to the continuous-time case, is not correct in this instance. The arithmetic of N, which seems to have no analog in continuous time, is crucial to the construction of the Hirschman optimal discrete representation. We suggest that more work in this important area be performed to determine what impact this has, and to find out how widespread this problem may be.