In this paper we investigate the kth lower multiexponent f(n, k) for tournament matrices. It was proved that f(n, 3) = 2 if and only if n greater than or equal to 11. Thus the conjecture in [2] is disproved. Further we obtain a new sufficient condition for f(n, k) = 1.
机构:
S China Normal Univ, Sch Math Sci, Guangzhou 510631, Guangdong, Peoples R ChinaS China Normal Univ, Sch Math Sci, Guangzhou 510631, Guangdong, Peoples R China
Huang, Yufei
Liu, Bolian
论文数: 0引用数: 0
h-index: 0
机构:
S China Normal Univ, Sch Math Sci, Guangzhou 510631, Guangdong, Peoples R ChinaS China Normal Univ, Sch Math Sci, Guangzhou 510631, Guangdong, Peoples R China
机构:
S China Normal Univ, Sch Math, Guangzhou 510631, Guangdong, Peoples R ChinaS China Normal Univ, Sch Math, Guangzhou 510631, Guangdong, Peoples R China
Liu, Bolian
Huang, Fengying
论文数: 0引用数: 0
h-index: 0
机构:
Guangdong Polytech Normal Univ, Sch Comp Sci, Guangzhou 510665, Guangdong, Peoples R ChinaS China Normal Univ, Sch Math, Guangzhou 510631, Guangdong, Peoples R China
机构:
Karadeniz Technical University, Department of Mathematics, Campus of Kanuni, TrabzonKaradeniz Technical University, Department of Mathematics, Campus of Kanuni, Trabzon
Keleş H.
Iraqi Journal for Computer Science and Mathematics,
2023,
4
(01):
: 10
-
14