Minimal Impact One-Dimensional Arrays

Leo Egghe and Ronald Rousseau
Additional contact information
Leo Egghe: University of Hasselt, 3500 Hasselt, Belgium
Ronald Rousseau: Faculty of Social Sciences, University of Antwerp, 2020 Antwerpen, Belgium

Mathematics, 2020, vol. 8, issue 5, 1-11

Abstract: In this contribution, we consider the problem of finding the minimal Euclidean distance between a given converging decreasing one-dimensional array X in ( R + ) ∞ and arrays of the form A a = ( a , a , … , a ? , 0 , 0 , … a t i m e s ) , with a 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.

Keywords: generalized h-index; generalized g-index; minimization problem (search for similar items in EconPapers)
JEL-codes: C (search for similar items in EconPapers)
Date: 2020
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
https://www.mdpi.com/2227-7390/8/5/811/pdf (application/pdf)
https://www.mdpi.com/2227-7390/8/5/811/ (text/html)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:gam:jmathe:v:8:y:2020:i:5:p:811-:d:359224

Access Statistics for this article

Mathematics is currently edited by Ms. Emma He

More articles in Mathematics from MDPI
Bibliographic data for series maintained by MDPI Indexing Manager ().