Permutation concentration conjecture for efficient and inefficient maximal configurations

Let maximal configurations be configurations to which the function $G$ maps permutations, and classify them as efficient or inefficient according to the settlement-planning model. Permutation concentration conjecture. Among all maximal configurations, the ones to which $G$ maps the most permutations include some efficient configurations, while the ones to which $G$ maps the fewest permutations include some inefficient configurations. This conjecture concerns the relationship between the sampling frequency induced by $G$ and the efficiency of maximal configurations; the supplied context provides simulation evidence but does not establish the claim.