A classification of peak-pit maximal Condorcet domains (Q6080658)

In this paper, the author introduces the concepts of weakly separated set-systems and generalised arrangements of pseudolines, demonstrating that they essentially represent the same object -- peak-pit maximal Condorcet domains. These new tools are used to establish that peak-pit maximal Condorcet domains coincide with the class of connected maximal Condorcet domains. Let \(D\) be a set of linear orders over a set \(A\) of \(n\) alternatives. \(D\) is called a \textit{Condorcet domain} if for every odd-numbered profile \(p\) over \(D\) the majority relation \(\succeq_p\) is transitive. Below we shall restrict ourselves to the definition of a \textit{connected} and of a \textit{peak-pit} Condorcet domain \(D\). The \textit{permutohedron} of order \(n\) is an undirected graph having \(n!\) vertices that are labelled by the linear orders over the set \(A\) of \(n\) alternatives such that each edge of the permutohedron connects a pair of vertices corresponding to two linear orders that differ by a swap of adjacent alternatives. A domain \(D\) of linear orders over \(A\) is \textit{connected} if it is formed by a connected subgraph of the permutohedron of order \(n\). A domain \(D\) of linear orders over a set \(A\) of \(n\) alternatives is called \textit{peak-pit} if for every triple \(\{a, b, c\}\) in \(A\) there is an \(x\) in \(\{a, b, c\}\) such that either \(xN_{\{a, b, c\}}1\) or \(xN_{\{a, b, c\}}2\) or \(xN_{\{a, b, c\}}3\) in all restrictions of the linear orders in \(D\) to \(\{a, b, c\}\), where \(xN_{\{a, b, c\}}i\) reads as: \(x\) is never at place \(i\). As mentioned, the author proves that peak-pit maximal Condorcet domains coincide with connected maximal Condorcet domains.