Minimal Impact One-Dimensional Arrays

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