{'fraction_non_alphanumeric': 0.017107309486780714, 'fraction_numerical': 0.0, 'mean_word_length': 5.1923076923076925, '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}}
Global solutions of partitioning problems

In this paper, a special kind of optimization problems is considered. The total cost function for a homogeneous group of participants– each with the same convex-concave cost function – is to be minimized. The particular structure of this problem makes it possible to find global minimizers in dependence on the linking parameter. The symmeric partition is a stationary solution and the optimal one for small parameter values. Beyond a critical parameter value one obtains certain non-symmetric solutions. Two geometrical applications are discussed. They are related to perimeter and volume partitions