{'fraction_non_alphanumeric': 0.02666666666666667, 'fraction_numerical': 0.004761904761904762, 'mean_word_length': 3.8433179723502304, 'pattern_counts': {'":': 0, '<': 2, '<?xml version=': 0, '>': 1, '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}}
The Dyck bound in the concave 1-dimensional random assignment model

We consider models of assignment for random N blue points and N red points on an interval of length 2N, in which the cost for connecting a blue point in x to a red point in y  is the concave function |x  −  y |p , for 0  <  p   <  1. Contrarily to the convex case p   >  1, where the optimal matching is trivially determined, here the optimization is non-trivial. The purpose of this paper is to introduce a special configuration, that we call the Dyck matching, and to study its statistical properties. We compute exactly the average cost, in the asymptotic limit of large N, together with the first subleading correction. The scaling is remarkable: it is of order N for , order for , and for , and it is universal for a wide class of models. We conjecture that the average cost of the Dyck matching has the same scaling in N as the cost of the optimal matching, and we produce numerical data in support of this conjecture. We hope to produce a proof of this claim in future work.