Student or educator? Sign up with your school email and get 6 months of Pro free.
Cited by 183

The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.

Counting the Faces of Randomly-Projected Hypercubes and Orthants, with Applications

Open access
Donoho, David L., Tanner, Jared·2010·Discrete & Computational Geometry

Abstract

AbstractLet A be an n×N real-valued matrix with n<N; we count the number of k-faces fk(AQ) when Q is either the standard N-dimensional hypercube IN or else the positive orthant ℝ+N. To state results simply, consider a proportional-growth asymptotic, where for fixed δ,ρ in (0,1), we have a sequence of matrices $A_{n,N_{n}}$ and of integers kn with n/Nn→δ and kn/n→ρ as n→∞. If each matrix $A_{n,N_{n}}$ has its columns in general position, then fk(AIN)/fk(IN) tends to zero or one depending on whether ρ>min (0,2−δ−1) or ρ<min (0,2−δ−1). Also, if each $A_{n,N_{n}}$ is a random draw from a distribution which is invariant under right multiplication by signed permutations, then fk(Aℝ+N)/fk(ℝ+N) tends almost surely to zero or one depending on whether ρ>min (0,2−δ−1) or ρ<min (0,2−δ−1). We make a variety of contrasts to related work on projections of the simplex and/or cross-polytope.These geometric face-counting results have implications for signal processing, information theory, inverse problems, and optimization. Indeed, face counting is related to conditions for uniqueness of solutions of underdetermined systems of linear equations. Below, let A be a fixed n×N matrix, n<N, with columns in general position. (a)Call a vector in ℝ+Nk-sparse if it has at most k nonzeros. For such a k-sparse vector x0, b=Ax0 generates an underdetermined system b=Ax having k-sparse solution. Among inequality-constrained systems Ax=b, x≥0, having k-sparse solutions, the fraction having a unique nonnegative solution is fk(Aℝ+N)/fk(ℝ+N).(b)Call a vector in the hypercube INk-simple if all entries except at most k are at the bounds 0 or 1. For such a k-simple vector x0, b=Ax0 generates an underdetermined system b=Ax with k-simple solution. Among inequality-constrained systems Ax=b, x∈IN, having k-simple solutions, the fraction having a unique hypercube-constrained solution is fk(AIN)/fk(IN).

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.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1007/s00454-009-9221-z

Cites

1 of 1 references verified0 citation errors · 0 not checkable

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.

A few free checks a day · papers already verified open instantly · results are public

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

See all 183

Metadata

Authors
Donoho, D. L., & Tanner, J.
Venue
Discrete & Computational Geometry
Published
2009-09-30
Volume
43
Issue
3
Pages
522-541
ISSN
  • 0179-5376 (ISSN-L)
  • 1432-0444
OpenAlex
W2101837693
Cited by
183
References
1
FWCI
14.84
Type
journal article
Language
en
Open access
bronze

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: Counting the Faces of Randomly-Projected Hypercubes and Orthants, with Applications. https://app.cochat.ai/papers/10.1007/s00454-009-9221-z
The paper
Donoho, D. L., & Tanner, J. (2010). Counting the Faces of Randomly-Projected Hypercubes and Orthants, with Applications. Discrete & Computational Geometry. https://doi.org/10.1007/s00454-009-9221-z

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.