For $\mathbb N^*:=\mathbb N \setminus \{0\}$, we consider the collection $\mathfrak M(N)$ of all the $N$ rows, for which, for $n=1,\cdots,N$, the $n-th$ row consists of an increasing sequence $(a_j^n)_j$ of real numbers. For $\mathfrak A \in \mathfrak M(N)$, we define its spectrum $σ(\mathfrak A)$ by $σ(\mathfrak A)=\{λ\in \mathbb R \;|\; λ=\sum_{n=1}^Na_{j_n}^n\}\,,$ where $(j_1,j_2,\dots,j_N)\in (\mathbb N^*)^N$. This spectrum is discrete and consists of an infinite sequence that can be ordered as a strictly increasing sequence $λ_k(\mathfrak A)$. For $λ\in σ(\mathfrak A)$ we denote by $m(λ,\mathfrak A) $ the number of representations of such a $λ$, hence the multiplicity of $λ$.\\ In this paper we investigate for given $N\in \mathbb N^*$ and $k\in \mathbb N^*$ the highest possible multiplicity (denoted by $\mathfrak m_k(N)$) of $λ_k(\mathfrak A)$ for $\mathfrak A \in \mathfrak M(N)$. We give the exact result for $N=2$ and for $N=3$ prove a lower bound which appears, according to numerical experiments, as a "good" conjecture. For the general case, we give examples demonstrating that the problem is quite difficult. \\ This problem is equivalent to the analogue eigenvalue multiplicity questions for Schrödinger operators describing a system of N non-interacting one-dimensional particles.