Minimal Impact One-Dimensional Arrays

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...

Full description

Bibliographic Details
Main Authors: Leo Egghe, Ronald Rousseau
Format: Article
Language:English
Published: MDPI AG 2020-05-01
Series:Mathematics
Subjects:
generalized h-index
generalized g-index
minimization problem
Online Access:https://www.mdpi.com/2227-7390/8/5/811
id doaj-eb93950ae24d49c18413cb099d2bfc8d
record_format Article
spelling doaj-eb93950ae24d49c18413cb099d2bfc8d2020-11-25T02:15:29ZengMDPI AGMathematics2227-73902020-05-01881181110.3390/math8050811Minimal Impact One-Dimensional ArraysLeo Egghe0Ronald Rousseau1University of Hasselt, 3500 Hasselt, BelgiumFaculty of Social Sciences, University of Antwerp, 2020 Antwerpen, BelgiumIn 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.https://www.mdpi.com/2227-7390/8/5/811generalized h-indexgeneralized g-indexminimization problem
collection DOAJ
language English
format Article
sources DOAJ
author Leo Egghe
Ronald Rousseau
spellingShingle Leo Egghe
Ronald Rousseau
Minimal Impact One-Dimensional Arrays
Mathematics
generalized h-index
generalized g-index
minimization problem
author_facet Leo Egghe
Ronald Rousseau
author_sort Leo Egghe
title Minimal Impact One-Dimensional Arrays
title_short Minimal Impact One-Dimensional Arrays
title_full Minimal Impact One-Dimensional Arrays
title_fullStr Minimal Impact One-Dimensional Arrays
title_full_unstemmed Minimal Impact One-Dimensional Arrays
title_sort minimal impact one-dimensional arrays
publisher MDPI AG
series Mathematics
issn 2227-7390
publishDate 2020-05-01
description 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.
topic generalized h-index
generalized g-index
minimization problem
url https://www.mdpi.com/2227-7390/8/5/811
work_keys_str_mv AT leoegghe minimalimpactonedimensionalarrays
AT ronaldrousseau minimalimpactonedimensionalarrays
_version_ 1724896003819044864

Similar Items