{'fraction_non_alphanumeric': 0.015184381778741865, 'fraction_numerical': 0.0, 'mean_word_length': 4.703703703703703, '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}}
Minimum firing times of firing squad synchronization problems for paths in grid spaces

We consider the firing squad synchronization problems for paths in the two and the three-dimensional grid spaces. Minimal-time solutions of these problems are not known and are unlikely to exist. However, at present we have no proofs of their nonexistence. In this paper we show one result that suggests what type of study is necessary in order to prove their nonexistence.