The combinatorially symmetric P-matrix completion problem

Most read articles by the same author(s)

• Miriam Farber, Mitchell Faulk, Charles R. Johnson, Evan Marzion, Exact results for perturbation to total positivity and to total nonsingularity , The Electronic Journal of Linear Algebra: Vol. 27 (2014)
• Charles R. Johnson, Robert Reams, Constructing copositive matrices from interior matrices , The Electronic Journal of Linear Algebra: Vol. 17 (2008)
• Shaun M. Fallat, Charles R. Johnson, Ronald L. Smith, The general totally positive matrix completion problem with few unspecified entries , The Electronic Journal of Linear Algebra: Vol. 7 (2000)
• Charles R. Johnson, J. M. Pena, Tomasz Szulc, Optimal Gersgorin-style estimation of the largest singular value. II , The Electronic Journal of Linear Algebra: Vol. 31 (2016)
• Charles R. Johnson, Carlos M. Saiago, Estimation of the maximum multiplicity of an eigenvalue in terms of the vertex degrees of the graph of a matrix , The Electronic Journal of Linear Algebra: Vol. 9 (2002)
• David A. Grundy, Charles R. Johnson, Dale D. Olesky, Pauline van den Driessche, Products of M-matrices and nested sequences of principal minors , The Electronic Journal of Linear Algebra: Vol. 16 (2007)
• Charles R. Johnson, Olivia Walch, Critical exponents: old and new , The Electronic Journal of Linear Algebra: Vol. 25 (2012)
• Charles R. Johnson, Cris Negron, Totally positive completions for monotonically labeled block clique graphs , The Electronic Journal of Linear Algebra: Vol. 18 (2009)
• Gi-Sang Cheon, Charles R. Johnson, Sang-Gu Lee, Ethan J. Pribble, The possible numbers of zeros in a orthogonal matrix , The Electronic Journal of Linear Algebra: Vol. 5 (1999)
• Charles R. Johnson, Maria da Graça Marques, Patterns of commutativity: the commutant of the full pattern, , The Electronic Journal of Linear Algebra: Vol. 14 (2005)