2 research outputs found

    Equal Entries in Totally Positive Matrices

    Full text link
    We show that the maximal number of equal entries in a totally positive (resp. totally nonsingular) n-by-nn\textrm{-by-}n matrix is Θ(n4/3)\Theta(n^{4/3}) (resp. Θ(n3/2\Theta(n^{3/2})). Relationships with point-line incidences in the plane, Bruhat order of permutations, and TPTP completability are also presented. We also examine the number and positionings of equal 2-by-22\textrm{-by-}2 minors in a 2-by-n2\textrm{-by-}n TPTP matrix, and give a relationship between the location of equal 2-by-22\textrm{-by-}2 minors and outerplanar graphs.Comment: 15 page
    corecore