A study of counterexamples for Craven's conjecture

In this paper, some examples are given to show that the maximal number of admissible preference orderings is greater than 2
ⁿ⁻¹
when n is greater than 3. And the recurrence formula of local maximal number is presented.