New Lower Bounds And Asymptotics For The Cp-Rank

Let p(n) denote the largest possible cp-rank of an n x n completely positive matrix. This matrix parameter has its significance both in theory and applications, as it sheds light on the geometry and structure of the solution set of hard optimization problems in their completely positive formulation. Known bounds for pn are s(n) = (n+1/2) -4 , the current best upper bound, and the Drew-Johnson-Loewy (DJL) lower bound d(n) = [n(2)/4]. The famous DJL conjecture (1994) states that pn = dn. Here we show p(n) = n(2)/2 + O(n(3/2)) = 2d(n) + O(n(3/2)) p(n) = n(2)/ 2 + O(n(3/2)) = 2dn + O(n(3/2)), and construct counterexamples to the DJL conjecture for all n = 12 (for orders seven through eleven counterexamples were already given in [I. M. Bomze, W. Schachinger, and R. Ullrich, Linear Algebra Appl., 459 (2014), pp. 208-221].