Minimal Impact One-Dimensional Arrays
In this contribution, we consider the problem of finding the minimal Euclidean distance between a given converging decreasing one-dimensional array X in (R<sup>+</sup>)<sup>∞</sup> and arrays of the form Aa=a,a,…,a, 0,0, …a times, with <i>a</i> being a natural num...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
MDPI AG
2020-05-01
|
| Series: | Mathematics |
| Subjects: | |
| Online Access: | https://www.mdpi.com/2227-7390/8/5/811 |
| Summary: | In this contribution, we consider the problem of finding the minimal Euclidean distance between a given converging decreasing one-dimensional array X in (R<sup>+</sup>)<sup>∞</sup> and arrays of the form Aa=a,a,…,a, 0,0, …a times, with <i>a</i> being a natural number. We find a complete, if not always unique, solution. Our contribution illustrates how a formalism derived in the context of research evaluation and informetrics can be used to solve a purely mathematical problem. |
|---|---|
| ISSN: | 2227-7390 |