Abstract
Let a norm on the set Mn of real or complex n-by-n matrices be given. We investigate the question of finding the largest constants αn and βn such that for each A∈Mn the average of the norms of its (n−1)-by-(n−1) principal submatrices is at least αn times the norm of A, and such that the maximum of the norms of those principal submatrices is at least βn times the norm of A.For a variety of classical norms including induced ℓp-norms, weakly unitarily invariant norms, and entrywise norms we give lower and upper bounds for αn and βn. In several cases αn and βn are explicitly determined.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callSimilar Papers
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
