A note on a reconstruction problem for number sequences

F. Göbel

    Research output: Book/ReportReportOther research output


    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$.
    Original languageEnglish
    Place of PublicationEnschede
    PublisherUniversity of Twente
    Publication statusPublished - 1998

    Publication series

    PublisherFaculty of Mathematical Sciences, University of Twente
    ISSN (Print)1566-7782


    • MSC-05A05


    Dive into the research topics of 'A note on a reconstruction problem for number sequences'. Together they form a unique fingerprint.

    Cite this