A discrete-lattice version of the Johnson-Lindenstrauss lemma is attempted, but a scaling error in the lower distortion bound leaves the central claim unproved.
Matou s ek, On variants of the Johnson–Lindenstrauss lemma, Random Struct
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
method 1
citation-polarity summary
fields
math.MG 1years
2025 1verdicts
REJECT 1roles
method 1polarities
use method 1representative citing papers
citing papers explorer
-
A remark on dimensionality reduction in discrete subgroups
A discrete-lattice version of the Johnson-Lindenstrauss lemma is attempted, but a scaling error in the lower distortion bound leaves the central claim unproved.