{'fraction_non_alphanumeric': 0.0175, 'fraction_numerical': 0.005, 'mean_word_length': 4.5625, '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}}
A sampling theorem for symmetric polygons

We present a simple construction of a set of uniqueness for the Paley-Wiener space of functions bandlimited to a symmetric 2N-sided polygonal region in the plane which consists of a union of at most N − 1 shifted lattices in the plane. The idea of the proof involves an application of a technique set forth in [2] that is based on decomposing such a bandlimited function into a combination of functions bandlimited to smaller sets. We also give a sufficient condition under which the set in question is a set of sampling and interpolation for the Paley-Wiener space and hence corresponds to a Riesz basis. This result differs from previous work on this topic, notably in [7], in that the technique is quite different and fewer shifted lattices are required.