{'fraction_non_alphanumeric': 0.01775147928994083, 'fraction_numerical': 0.0, 'mean_word_length': 5.512820512820513, '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 generalized FFT for Clifford algebras

This paper describes a relationship between fast real matrix representations of real universal Clifford algebras and the generalized Fast Fourier Transform for supersolvable groups. Detailed constructions of algorithms for the forward and inverse representations for Clifford algebras are given, with proof that these need at most O(d log d) operations. The algorithms have been implemented and tested in the GluCat C++ library, and some timing results are included.