In this paper, we classify all maximal peak-pit Condorcet domains of maximal width for $n\le 5$ alternatives. To achieve this, we bring together ideas from several branches of combinatorics. The main tool used in the classification is the ideal of a domain. In contrast to the size of maximal peak-pit Condorcet domains of maximal width themselves, the size of their associated ideal is constant.

中文翻译：

---

对最大峰坑孔多塞域的分类

在本文中，我们将最大宽度的所有最大峰坑孔多塞域分类为 $n\le 5$备择方案。为了实现这一点，我们汇集了来自组合学几个分支的想法。分类中使用的主要工具是理想的域。与最大宽度本身的最大峰坑孔多塞域的大小相反，其相关理想的大小是恒定的。