On minimal $\pi$-circuits of closing contacts for symmetric functions with threshold 2

In this paper, we study the complexity of realisation of monotone symmetric functions of algebra of logic with threshold 2 by $\pi$-circuits of closing contacts. We find the precise value of this complexity and construct the corresponding minimal circuits both in the case of unit weights of all contacts and in the case where contacts of distinct variables may be of distinct weights.