{'fraction_non_alphanumeric': 0.012646793134598013, 'fraction_numerical': 0.0, 'mean_word_length': 5.595238095238095, '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}}
Classes of lexicographic equivalence in Euclidean combinatorial optimisation on arrangements

We consider an application of regular partitions of a space to the solution of Euclidean combinatorial optimisation problems, in particular, conditional optimisation problems on arrangements. We introduce the notion of points of the space equivalent with respect to arrangements and show that the introduced relation between points is an equivalence relation. We give algorithms to search for an element of the set of arrangements which is a representative of the combinatorial class closest to a given class with respect to the lexicographic order (increasing or decreasing). We consider also a new class of optimisation problems, namely, problems of linear conditional lexicographic maximisation on arrangements. We suggest and analyse algorithms for solving the problems of this class. The algorithms are based on the ordered checking of admissible points in the lexicographic (increasing or decreasing) order and use the algorithms to search for the closest element of the set of arrangements mentioned above.