TY - BOOK

T1 - A note on a reconstruction problem for number sequences

AU - Göbel, F.

PY - 1998

Y1 - 1998

N2 - We consider the following problem: for which values of $n$ can the sequence $a_1,\ldots, a_n$ of real numbers be reconstructed (up to order) from the sequence $s_1,\ldots, s_m$ of the sums $a_i + a_j$ where $1 \le i < j \le n$, and $m ={n\choose 2}$? The answer is positive for $n = 3,5,6$, and it is negative for $n=2^k$ with $k \ge 0$.

AB - We consider the following problem: for which values of $n$ can the sequence $a_1,\ldots, a_n$ of real numbers be reconstructed (up to order) from the sequence $s_1,\ldots, s_m$ of the sums $a_i + a_j$ where $1 \le i < j \le n$, and $m ={n\choose 2}$? The answer is positive for $n = 3,5,6$, and it is negative for $n=2^k$ with $k \ge 0$.

KW - MSC-05A05

M3 - Report

T3 - Memorandum

BT - A note on a reconstruction problem for number sequences

PB - University of Twente

CY - Enschede

ER -