{'fraction_non_alphanumeric': 0.014975041597337771, 'fraction_numerical': 0.0, 'mean_word_length': 5.404255319148936, '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}}
Constructions and existence of tight fusion frames

Fusion frames are an emerging topic of frame theory, with applications to communications and distributed processing. However, until recently, little was known about the existence of tight fusion frames, much less how to construct them. We discuss a new method for constructing tight fusion frames which is akin to playing Tetris with the spectrum of the frame operator. When combined with some easily obtained necessary conditions, these Spectral Tetris constructions provide a near complete characterization of the existence of tight fusion frames.