Pacific Journal of Mathematics · 1976 · 62 citations · 27 references
Natural SciencesComputer ScienceBicameralismComputational GeometryRepresentation TheoryEigenvalue ProblemsLinear AlgebraMatrix ComputationSpectral TheoryEigenvalue MultiplicityEigenvalue Spectral AnalysisGeneralized Eigenvalue ProblemsSpectral Theorem
Let \l be an (r -l)(2nr + 2)/2 dimensional subspace of rc x n real valued symmetric matrices. Then U contains a nonzero matrix whose greatest eigenvalue is at least of multiplicity r, if 2^= r ^ n -1. This bound is best possible. We apply this result to prove the Bohnenblust generalization of CalabFs theorem. We extend these results to hermitian matrices.
27
Generating large indecomposable continua
Michel Smith · Pacific Journal of Mathematics · 1976 · 43 citations · Full text