“…f : R → R is continuous, and G = (g ij ) n×n is an n × n square matrix. The existence of positive solutions for system (1) has been extensively studied in the literature; see [2,3,5,6,10,11,13,15,17,20,21,24,[27][28][29] and the references therein. However, to the best of our knowledge, almost all obtained results require that the coefficient matrix G ≥ 0 or G > 0, where G ≥ 0 if g ij ≥ 0 and G > 0 if g ij > 0 for (i, j) ∈ [1, n] An n × n square matrix G is called a sign-changing coefficient matrix if its elements change the sign.…”