{'fraction_non_alphanumeric': 0.0205761316872428, 'fraction_numerical': 0.00205761316872428, 'mean_word_length': 5.012345679012346, '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}}
Lattice Partitions with a Straight Line

Abstract In [1], the solution of a problem of distinct digital filter enumeration was expressed in terms of enumerating partitions of a rectangular set of lattice points with a straight line, under certain restrictions. Here, firstly, an explicit expression is derived for the number of such partitions in that and a more general case. Secondly, the asymptotic ratio of partitions to square of lattice dimensions is derived for a square lattice.