MathOverflow

The classical Müntz theorem states that a set of monomials $\{1\} \cup \{x^\lambda\}_{\lambda \in \Lambda}$ is complete in $C[0,1]$ if and only if $\sum_{\lambda \in \Lambda} \frac{1}{\lambda} = \infty$. On an interval away from the origin, i.e. $C[a...

What is a good reference for the following result which I believe is proved by Tchebotarev.
There are exactly 5 types of Lunes that are squarable. (Hippocrates produced three and then two more were given by Euler).

Recently, I am reading the paper of Fanghua Lin named "A New Proof of the Caffarelli-Kohn-Nirenberg Theorem".
I have a question regarding the proof of Lemma 2.3, the statement of the lemma and proof the lemma as written in the paper is as follows:
Lemma 2.3 : Let $(v,P)$ be a weak solution of (1.1) - (1.2) in $Q_1 = (-1,0)\times B_1$ with $v \in L^\infty(-1,0; L^2_{\sigma}(B_1)) \cap L^2(0,T; H^1_{0,\sigma}(B_1))$. Then $P \in L^{5/3}(-1,0; L^{15/14}(B_1))$....

General question: To place n points on the boundary of a given m-vertex convex polygonal region, maximising the minimum pairwise Euclidean distance between the points. The distance is to be measured over the polygonal region.
Can one form an algorithm that is polynomial in both m and n?...