文章通过对一类n(n≥10)阶本原不可幂几乎可约的符号模式的研究,运用SSSD途径对得到了这类符号模式的K重上基的上界,运用弗比尼斯数得到了这类符号模式的K重上基的下界.在研究中也发现这类符号模式的K重上基之间存在"间隙".
In this paper,we study thekth upper bases of a class of primitive nonpowerful nearly reducible sign patterns of order n≥10.The upper of bound of thekth upper bases of the class of primitive nonpowerful nearly reducible sign patterns is obtained by a pair of SSSD,and the lower of bound of thekth upper bases is obtained by frobenius numbers.We also find that there exists a ″gap″ in thekth upper bases of primitive nonpowerful nearly reducible sign patterns.