{'fraction_non_alphanumeric': 0.015555555555555555, 'fraction_numerical': 0.0, 'mean_word_length': 5.094594594594595, '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}}
Algorithmic characterization of pentadiagonal ASSR matrices

ABSTRACT A matrix is sign regular if all its minors of the same order are of the same sign. A very important subclass of sign regular matrices is formed by those matrices whose non-trivial minors are non-zero. These matrices are called almost strictly sign regular matrices. In this work, an algorithmic characterization of pentadiagonal almost strictly sign regular matrices is presented.