The DOI matches its Crossref record.
On the Abstract Properties of Linear Dependence1
Abstract
Let C 1 , C 2 ,· · · ,C m be the columns of a matrix M . Any subset of these columns is either linearly independent or linearly dependent; the subsets thus fall into two classes. These classes are not arbitrary; for instance, the two following theorems must hold
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cited by
Shapley, L. S. (1971) · International Journal of Game Theory · doi:10.1007/bf01753431 · Cited by 1,613
The Traveling-Salesman Problem and Minimum Spanning Trees
Held, M., & Karp, R. M. (1970) · Operations Research · doi:10.1287/opre.18.6.1138 · Cited by 1,440
The Design of Approximation Algorithms
Williamson, D. P., & Shmoys, D. B. (2011) · Cambridge University Press eBooks · doi:10.1017/cbo9780511921735 · Cited by 1,301
Matroids and the greedy algorithm
Edmonds, J. (1971) · Mathematical Programming · doi:10.1007/bf01584082 · Cited by 866
(2005) · Choice Reviews Online · doi:10.5860/choice.42-2854b · Cited by 639
Metadata
- Authors
- Whitney, H.
- Venue
- Classic Papers in Combinatorics
- Publisher
- Birkhäuser Boston
- Published
- 2009
- Pages
- 63-87
- OpenAlex
- W2100658172
- Cited by
- 653
- References
- 0
- FWCI
- 33.36
- Type
- book chapter
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: On the Abstract Properties of Linear Dependence1. https://app.cochat.ai/papers/10.1007/978-0-8176-4842-8_5
- The paper
- Whitney, H. (2009). On the Abstract Properties of Linear Dependence1. Classic Papers in Combinatorics. https://doi.org/10.1007/978-0-8176-4842-8_5
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.