{'fraction_non_alphanumeric': 0.0162748643761302, 'fraction_numerical': 0.0, 'mean_word_length': 5.087912087912088, '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}}
On the boundedness behavior of the spectral factorization in the Wiener algebra for FIR data

It is known that the spectral factorization mapping is unbounded in the Wiener algebra, in general. However in applications, the given data are often polynomials. For such finite dimensional spectra, the spectral factorization mapping is bounded, of course, but the boundedness constant depends on the degree of the given polynomial spectra. This paper presents lower and upper bounds for this boundedness constant depending on the degree N of the given data.