Stack Exchange network consists of 183 Q&A communities including Stack Overflow, the largest, most trusted online community for developers to learn, share their knowledge, and build their careers.
Some others comments : if you remove one of the two hypothesis, the result is wrong even for $N=2$. Moreover, I have an algorithm that produces a lot of examples of such $F$ for which the proposition was always satisified.
No, the order is the product order which is only a partial order: $$(x_1,x_2,\cdots,x_N)\leq(y_1,y_2,\cdots,y_N)$$ if and only $$x_i\leq y_i$$ for all i=1..N. Moreover, LSpice is correct. Thanks for your interest.
Well, I am pretty convinced that this is true : I have an implemented an algorithm that computes the correct sequence of $\Delta_i$. This algorithm never failed. The most strange fact, at least to me, is the uniqueness. Notice that if, for instance, the integer $n_i$ is bigger than $4$ then the only possibility is $\Delta_i=0$. Thus, the problem reduces to small values of $n_i$. One last comment : this question comes from some consideration in geometry of germ of complex curve in the complex plane.