6
$\begingroup$

Let $S$ be a finite subset of the complex unit circle and $1 \in S$. For each $n \in \mathbb N $, define $f_n\colon S^{n-1}\to\mathbb R$ by $$f_n(x) := \sum_{w^{n}=1}|x_1w+ x_2w^2\cdots+x_{n-1}w^{n-1}|$$ Denote $z^*_n := \min_{S^{n-1}} f_n$.

Is it true that for sufficiently large $n$s (which depend on $S$), we have $z_n^* = 2(n-1)$?

Remarks:

  • $f_n(x)$ is sum of the absolute values of eigenvalues of a circulant matrix generated by $(0,x_1,x_2,\ldots,x_{n-1})$.

  • $f_n(x) = 2(n-1)$, when $x$ is all ones vector.

  • Above question stems from this question and may be related to the Littlewood problem, as a comment of Tao to the last linked question.

$\endgroup$
0

1 Answer 1

3
$\begingroup$

The answer is no if there exists $z \in S$ with $z \neq 1$ and $\vert 1 - z\vert \leq \frac{1}{2}$ and $\bar{z} \in S$ :

Let $$p(x) = \sum_{k=0}^{n-1} b_k x^k$$ and $x_k = p(w^k)$ , where $w=e^{\frac{2 \pi i}{n}}$ .

Then the $n b_k$ are the eigenvalues of the circulant matrix.

Now choose
$$p(x) = 1 - \frac{1}{n} \sum_{k=0}^{n-1} x^k + (z-1) \frac{1}{n} \sum_{k=0}^{n-1} w^k x^k + (\bar{z}-1) \frac{1}{n} \sum_{k=0}^{n-1} w^{-k} x^k$$

Then $p(1)=0$, $p(w)=\bar{z}$, $p(w^{-1})=z$ and $p(w^k)=1$ otherwise.

Furthermore we have $b_0 = 1 - \frac{1}{n}(3 - 2 Re (z))$ and $b_k = \frac{1}{n}(-1 + 2 Re ((z-1)w^k)) \leq 0$ for $k \neq 0$.

Therefore $$\sum_{k=0}^{n-1} \vert b_k\vert = 2 b_0 < 2 (1 - \frac{1}{n})$$

$\endgroup$
2
  • $\begingroup$ The $n b_k$ are the fourier transform of the $x_k$ and therefore the eigenvalues of the circulant matrix : $n b_k = \sum_{l=0}^{n-1} x_l w^{-lk}$ . $\endgroup$
    – jjcale
    Jun 25, 2018 at 17:44
  • $\begingroup$ Since your mentioned circulant matrices are Hermitian, your answer is also an answer to my another question: mathoverflow.net/questions/302424/… $\endgroup$
    – Mahdi
    Jun 25, 2018 at 21:59

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service and acknowledge you have read our privacy policy.

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