ORCID: https://orcid.org/0000-0001-9738-2487 und Speegle, Darrin
(1. October 2006):
A redundant version of the Rado–Horn Theorem.
In: Linear Algebra and its Applications, Vol. 418, No. 1: pp. 1-10
Abstract
The Rado–Horn Theorem gives a characterization of those sets of vectors which can be written as the union of a fixed number of linearly independent sets. In this paper, we study the redundant case. We show that then the span of the vectors can be written as the direct sum of a subspace which directly fails the Rado–Horn criteria and a subspace for which the Rado–Horn criteria hold. As a corollary, we characterize those sets of vectors, which, after the deletion of a fixed number of vectors, can be written as the finite union of linearly independent sets.
| Item Type: | Journal article |
|---|---|
| Faculties: | Mathematics, Computer Science and Statistics > Mathematics > Bavarian Chair for Mathematical Foundations of Artificial Intelligence |
| Subjects: | 500 Science > 510 Mathematics |
| ISSN: | 00243795 |
| Language: | English |
| Item ID: | 126490 |
| Date Deposited: | 18. Jun 2025 06:26 |
| Last Modified: | 18. Jun 2025 06:26 |
