I have the intuition that a sample of size $n$ should be able to be described uniquely by just N moments. But I don't know if that's true.
The idea is that, first, it is obvious that a sample of $n = 1$ can be uniquely describe by just the sample mean. For $n = 2$, knowing the first two (uncentered) moments is also enough because (if I did my maths correctly)
$$ X_1 = 2\overline{X} - X_2 $$ and
$$ M_2 = 1/2X_2^2 - 2M_1X_2+2M_1^2 $$ From which I can solve for $X_2$ and then $X_1$ by knowing $M_1$ and $M_2$.
It seems intuitive that this must hold on for $n > 2 $. The generalization for a sample of size $n$ and $m$ moments would be
\begin{matrix} x_1 + x_2 + ... + x_n = nM_1\\ x_1^2 + x_2^2 + ... + x_n^2 = nM_2 \\ \vdots \\ x_1^m + x_2^m + ... + x_n^m = nM_m \end{matrix}
It these were linear equations, they would only have an unique solution for $n = m$ if the system described a full rank matrix. But they aren't, so... no dice.
From an information theory standpoint it seems to me (again, intuitively) that you shouldn't need more than $N$ numbers to represent any other $N$ numbers.
Note that I'm not trying to estimate the population distribution by the sample moments. I'm talking about describing a specific vector of $n$ values.
Also note that I assume that the order of samples does not matter so that $(x_1, x_2)$ and $(x_2, x_2)$ would be treated as the same solution.
Any hints on this problem?