5
$\begingroup$

I am looking for a proof of the inequality as follows:

Conjecture: Let $A_1A_2....A_n$ be the regular polygon incribed a circle $(O)$. Let $B_1B_2....B_n$ be a polygon incribed the circle $(O)$. Denote $x_{ij}=A_iA_j$ and $y_{ij}=B_{i}B_{j}$ then:

$$\sum_{i<j} x_{ij}^\alpha \ge \sum_{i<j} y_{ij}^\alpha $$

Where $ 1 \leq \alpha \leq 2$.

  • The case $ \alpha = 1 $ was proved in our paper in here

  • The case $ \alpha = 2 $ was proved in here

Example:

  • $n=3$, let $ABC$ be a triangle with sidelength $a, b, c$ then we have the inequality as follows:

$$a^\alpha + b^\alpha+ c^\alpha \leq 3\times 3^{\frac{\alpha}{2}}R^\alpha$$ Where $ 1 \leq \alpha \leq 2$, $R$ is circumradius.

See also:

$\endgroup$
3
  • 1
    $\begingroup$ Dear Mr Dao, I think polygon $B_1B_2...B_n$ need be convex? $\endgroup$ Jul 12, 2018 at 9:27
  • 1
    $\begingroup$ @TranQuangHung I don't think that $\endgroup$ Jul 12, 2018 at 14:12
  • 1
    $\begingroup$ That's right Mr Dao, thank you very much. I thought the regular polygon was convex but this is not really. $\endgroup$ Jul 12, 2018 at 14:47

0

Your Answer

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

Browse other questions tagged or ask your own question.