Summary: In this paper, we address sorting networks that are constructed from comparators of arity \(k>2\). I.e., in our setting the arity of the comparators – or, in other words, the number of inputs that can be sorted at the unit cost – is a parameter. We study its relationship with two other parameters – \(n\), the number of inputs, and \(d\), the depth.
This model received considerable attention. Partly, its motivation is to better understand the structure of sorting networks. In particular, sorting networks with large arity are related to recursive constructions of ordinary sorting networks. Additionally, studies of this model have natural correspondence with a recent line of work on constructing circuits for majority functions from majority gates of lower fan-in.
Motivated by these questions, we initiate the studies of lower bounds for constant-depth sorting networks. More precisely, we consider sorting networks of constant depth \(d\) and estimate the minimal \(k\) for which there is such a network with comparators of arity \(k\). We prove tight lower bounds for \(d\leq 4\). More precisely, for depths \(d=1,2\) we observe that \(k=n\). For \(d=3\) we show that \(k=\lceil\frac{n}{2}\rceil\). As our main result, we show that for \(d=4\) the minimal arity becomes sublinear: \(k=\Theta(n^{2/3})\). This contrasts with the case of majority circuits, in which \(k=O(n^{2/3})\) is achievable already for depth \(d=3\). To prove these results, we develop a new combinatorial technique based on the notion of access to cells of a sorting network.
For the entire collection see [Zbl 1507.68037].