MathOverflow is a question and answer site for professional mathematicians. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

First let me define Difference multiset for a set of integers $$P=\{p_1,p_2, \dots,p_K\} ,\quad p_i \in\{1,2,\dots,N\},\quad p_i\ne p_j $$ as below: $$ D = \{p_i-p_j \mod N ,\quad i \ne j\} $$ I know that the minimum of $f(x)$ is same for all $P$'s having same difference multiset (homometric $P$'s) & and also the optimal $x$ (minimizing $f$) is same for all of them up to permutation of elements, (also for all homometric $P$'s same $l$ is the inner maximizer) , where $f(x)$ is a real function which is defined as:

$$\large f(x) = \max_{1 \leq l \leq N-1} {\sum_{j=1}^K \sum_{k=1}^K x_j x_k e^{\frac{i2\pi l(p_j-p_k)}N} \over \left( \sum_{i=1}^K x_i\right)^2 } = \max_{1 \leq l \leq N-1} { \sum_{i=1}^K x_i^2 + \sum_{j,k} x_j x_k cos(\frac{2\pi l(p_j-p_k)}N) \over \left( \sum_{i=1}^K x_i\right)^2 } $$ $x_i$'s are positive variables

I achieved this result from simulations. I'm looking for a proof or even a justification which helps me prove it.

Let me give you an example of my simulations if it helps:

suppose $(N,K)= (6, 4)$

$$ P = \{1,2,3,5\} \Rightarrow D = \{1,1,2,2,2,3,3,4,4,4,5,5\} $$ minimizing $f(x)$ with $p_i$'s being members of $P$, led to this $x=(4,5,4,4)$

and for $$ P' = \{1,2,4,6\} \Rightarrow D' = \{1,1,2,2,2,3,3,4,4,4,5,5\} = D $$ minimizing $f(x)$ with $p_i$'s being members of $P'$, led to this $x=(5,4,4,4)$

Also note that $f(x) $ is independent of $||x||_2$ and is just function of angle of vector $x$.

I've also asked this on ME

share|cite|improve this question

closed as off-topic by Gerry Myerson, Andrés E. Caicedo, Andrey Rekalo, David White, Scott Morrison Jul 25 '13 at 2:07

This question appears to be off-topic. The users who voted to close gave this specific reason:

  • "This question does not appear to be about research level mathematics within the scope defined in the help center." – Andrés E. Caicedo, Scott Morrison
If this question can be reworded to fit the rules in the help center, please edit the question.

May I suggest replacing the title with a more informative and descriptive one? That may attract more people who may be able to give you an answer. – Ricardo Andrade Jul 23 '13 at 8:19
crossposted:… – Greg Martin Jul 23 '13 at 8:26
@Mahdi: I apologize for being unclear before. My suggestion was to briefly describe your particular problem (i.e what you want to show) in the title. That could give people an idea of what the question is about, possibly prompting them to read the question. – Ricardo Andrade Jul 23 '13 at 8:47
This question isn't about Mathematics, it's about guessing what the question is. – Gerry Myerson Jul 23 '13 at 23:08
Best guess is that OP "knows" (from simulations) that "the minimum of $f(x)$ is the same...", but doesn't know it in the sense of possessing a rigorous proof, and that's what OP wants. Agreed that the question is a little jumbled. – Todd Trimble Jul 24 '13 at 2:59

$N=6$, $K=4$, $P=\{1,2,4,5\}$, $x=(1,1,1,1)$, $l=1$ seems to give $f(x)=0$.

There are values of the parameters for which $f$ has no minimum. Take $N=5$, $K=4$, $P=\{1,2,3,4\}$, $x=(a,b,b,a)$, $l=1$. Let $$\theta=\sum x_je^{2\pi il/N}=a(\beta+\beta^4)+b(\beta^2+\beta^3)$$ where $\beta=e^{2\pi i/5}$. Now, $\beta+\beta^4=(\sqrt5-1)/2$, $\beta^2+\beta^3=-(\sqrt5+1)/2$, and these two numbers are linearly independent over the rationals, so there are arbitrarily large $a$ and $b$ for which $|\theta|$ is arbitrarily small. So $$f(x)={|\theta|^2\over4(a+b)^2}$$ can be made arbitrarily close to zero. It can't be exactly zero, since $\beta,\dots,\beta^4$ are linearly independent over the rationals.

share|cite|improve this answer
Thank You so much for your attention! But l is not arbitrary. If I didn't mention it, that's because I didn't want to put off the readers and I thought it is not important, but seems it is. Let me correct my mistake. – Mahdi Khosravi Jul 23 '13 at 13:22
OK, let's review the bidding. You post a question here and on, without notifying either site until you get caught. The question itself is a dog's breakfast. Despite my repeated attempts here and on to get you to post something comprehensible and complete, you insist on withholding important information. Now, after I take the time to compose an answer, you move the goalposts again. You don't want an answer to your question --- you won't even tell anyone what your question is. Voting to close. – Gerry Myerson Jul 23 '13 at 23:06
I'm so sorry, but I didn't want to make you angry. My question is not secret! I just wanted to say less to attract more. – Mahdi Khosravi Jul 24 '13 at 4:56

Not the answer you're looking for? Browse other questions tagged or ask your own question.