User 002 - MathOverflow most recent 30 from http://mathoverflow.net 2013-06-18T22:39:59Z http://mathoverflow.net/feeds/user/2912 http://www.creativecommons.org/licenses/by-nc/2.5/rdf http://mathoverflow.net/questions/10408/rolles-theorem-in-n-dimensions Rolle's theorem in n dimensions 002 2010-01-01T21:51:09Z 2010-04-22T02:29:23Z <p>This looks like a statement from a calculus textbook, which perhaps it should be. </p> <p>"Rolle's theorem". Let <code>$F\colon [a,b]\to\mathbb R^n$</code> be a continuous function such that F(a)=F(b) and F'(t) exists for all <code>$a&lt;t&lt;b$</code>. Then there exist numbers <code>$a &lt; t_1 &lt; t_2 &lt; \dots &lt; t_n &lt; b$</code> such that the vectors <code>$F'(t_1),\dots,F'(t_{n})$</code> are linearly dependent. </p> <p>We are all familiar with the case n=1. The case n=2 is not hard either: pick any <code>$a&lt;t^\ast&lt;b$</code> and find, using the mean value theorem, numbers <code>$a&lt;t_1&lt;t^\ast$</code> and <code>$t^*&lt;t_2&lt;b$</code> such that <code>$F'(t_j)$</code> is collinear with <code>$F(t^\ast)-F(a)$</code>. Note that we avoided using the parameter value <code>$t^\ast$</code>, which will be important in a moment. When n=3, we pick <code>$a&lt;t^\ast&lt;b$</code> and project F onto the orthogonal complement of <code>$F'(t^\ast)$</code>, then apply the case n=2 to the projection ($t^\ast$ will become the third chosen parameter value). So far so good.</p> <p>But I get stuck at n=4. If the above process is followed, then after F is projected down to two dimensions, we must avoid two particular parameter values. Which is not possible in general: if in two dimensions F parametrizes a triangle and F(a) is a vertex, then one of points <code>$F(t_j)$</code> must be one of two other vertices. Presumably this problem can avoided by a generic choice of points of projection, but how? </p> http://mathoverflow.net/questions/11283/determination-of-a-symmetric-convex-region-by-parallel-sections Determination of a symmetric convex region by parallel sections 002 2010-01-10T02:36:02Z 2010-04-22T02:08:08Z <p>This question is partly inspired by a problem in Stewart's Calculus: "Find the area of the region enclosed by $y=x^2$ and $x=y^2$."</p> <p>Suppose $f\colon [0,1]\to [0,1]$ is a convex increasing function that fixes 0 and 1. The graphs $y=f(x)$ and $x=f(y)$ enclose a convex region. To find its area, students will likely integrate the length of vertical sections: $f^{-1}(x)-f(x)$. They are unlikely to ask if two different functions can yield the same integrand. But I'll ask: </p> <blockquote> <p>Does $f^{-1}-f$ determine $f$? (Among all convex increasing functions that fix 0 and 1).</p> </blockquote> http://mathoverflow.net/questions/10347/level-set-of-a-harmonic-function Level set of a harmonic function 002 2010-01-01T03:29:50Z 2010-04-21T23:50:33Z <p>Let $u$ be a nonconstant real-valued harmonic function defined in the open unit disk $D$. Suppose that $\Gamma\subset D$ is a smooth connected curve such that $u=0$ on $\Gamma$. Is there a universal upper bound for the length of $\Gamma$? </p> <p>Remark: by the Hayman-Wu theorem, the answer is yes if $u$ is the real part of an injective holomorphic function; in fact, in this case there is a universal upper bound for the length of the entire level set in $D$. For general harmonic functions, level sets can have arbitrarily large length, e.g. $\Re z^n$.</p> http://mathoverflow.net/questions/21298/how-to-best-distribute-points-on-two-concentric-circles How to best distribute points on two concentric circles? 002 2010-04-14T03:56:17Z 2010-04-17T16:45:59Z <p>An N-subset <code>$\{x_1,\dots,x_N\}$</code> of a compact set $X\subset \mathbb R^d$ is called a set of <em>Fekete points</em> (named after <a href="http://en.wikipedia.org/wiki/Michael_Fekete" rel="nofollow">Michael Fekete</a>) if it maximizes the product <code>$$\prod_{1\le k&lt;j\le N}|x_k-x_j|\qquad (1)$$</code> among all such $N$-tuples. When $X\subset \mathbb C$, one can express this product in terms of the Vandermonde determinant. In this case Fekete points are of particular interest in approximation theory (as interpolation nodes). Generally, they have no explicit form and must be found numerically. But there are exceptions.</p> <p>When $X$ is a circle, Fekete points are equally spaced. This is well-known and can be proved like this: we may assume <code>$x_k=\exp(i\theta_k)$</code> with <code>$0=\theta_1&lt;\theta_2&lt;\dots &lt;\theta_N&lt;2\pi$</code>. For a fixed integer $m$, $1\le m\le \lfloor N/2 \rfloor$, consider the product <code>$\Pi(m)=\prod_{k=1}^N|x_{k+m}-x_{k}|$</code> with indices taken mod $N$. Since each point <code>$x_k$</code> appears in just two terms of this product, it is not hard to see that $\Pi(m)$ is maximal when $x_k$ are equally spaced. (Indeed, $\log \sin$ is a concave function.)</p> <p>Now let $X$ be the union of two concentric circles of radii $r$ and $R$. Assume that $N=2n$ is even and that exactly $n$ of the points lie on each circle. With this additional assumption we are not quite in the Fekete problem anymore, but we have an obvious candidate for the maximum -</p> <blockquote> <p>Under the assumptions of the preceding paragraph, is the product (1) maximized by equally spaced, interlaced points? E.g., by <code>$$x_k=\begin{cases} r\exp(2\pi i k/n), \quad k=1,\dots,n \\ R\exp(\pi i (2k-1)/n), \quad k=n+1,\dots,2n \end{cases} \qquad (2)$$</code></p> </blockquote> <p>Presumably, a solution would consist of two steps. </p> <ol> <li>Show that the maximum is attained by interlaced points, i.e., when ordered by the argument, the points alternate between the two circles. </li> <li>Show that for interlaced points, maximum of (1) is attained when they are equally spaced. </li> </ol> <p>One can hope that step 2 is doable with standard calculus tools, since there should be no other local maxima for interlaced points. But Step 1 seems to require a more imaginative approach. </p> <p>Why do I find this question interesting? There is a natural way to distribute N points on a circle (i.e., at equal distances), and this configuration is known to give the solution for many extremal problems, such as the Fekete problem, isoperimetric N-gon problem, etc. There is also a natural way to distribute <strong>two</strong> sets of N points -- namely, by formula (2), but I don't know of any nontrivial problem for which the optimality of such configuration has been established. </p> http://mathoverflow.net/questions/19772/approximately-holomorphic-functions/20084#20084 Answer by 002 for Approximately holomorphic functions 002 2010-04-01T16:44:49Z 2010-04-01T16:44:49Z <p>Men'shov proved in 1936 that if $f\colon D\to\mathbb C$ is continuous and approximately differentiable outside of a countable set, then it is holomorphic in $D$ <a href="http://www.mathnet.ru/php/archive.phtml?wshow=paper&amp;jrnid=sm&amp;paperid=5370&amp;option_lang=rus" rel="nofollow">1</a> (Russian original with French summary). In the same paper he gives an example, attributed to Lusin, which shows that continuity cannot be dropped entirely even if the function is approximately differentiable at every point. Let $\varphi\colon\mathbb C\to\mathbb C$ be an entire function that tends to $0$ as $z\to\infty$ within any sector <code>$\{|\arg z|&lt;\pi-\epsilon\}$</code> (approximation theory can be used to create such examples). Then $f(z)=z\varphi(1/z)$ has an approximate derivative everywhere in $\mathbb C$, but of course it is not differentiable or even continuous at $0$. </p> <p>Men'shov asked if continuity can be replaced with boundedness. This was answered affirmatively by Telyakovskii 50 years later <a href="http://www.ams.org/mathscinet-getitem?mr=837136" rel="nofollow">2</a>. In fact, boundedness can be weakened to logarithmic integrability. </p> <p>Brodovich <a href="http://www.ams.org/mathscinet-getitem?mr=1241165" rel="nofollow">3</a> proved that an injective function with an approximate derivative at every point is holomorphic. (MR review omits the injectivity assumption). A survey of results in this area was written by Dolzhenko <a href="http://www.ams.org/mathscinet-getitem?mr=1211822" rel="nofollow">4</a>, but it predates the work of Brodovich. </p> http://mathoverflow.net/questions/15509/solutions-to-a-monge-ampere-equation-on-the-simplex/16206#16206 Answer by 002 for Solutions to a Monge-Ampère equation on the simplex 002 2010-02-23T22:46:50Z 2010-02-23T22:46:50Z <p>Any set of values of $u$ at the vertices of $\Delta_k$ can be attained just by adding an affine function to $u$, which does not change $M[u]$. To see that the solution of your problem is not unique, consider $u(x,y)=ax^2+a^{-1}y^2+\mathrm{(affine\ terms)}$ with $a>0$. Clearly $M[u]=4$ for any $a$. </p> <p>On the other hand, Theorem 1.6.2 in the book <em>The Monge-Ampère equation</em> by C. Gutierréz states that there is a unique convex solution of $M[u]=\mu$ (with $M[u]$ properly understood) with prescribed continuous boundary values in a <strong>strictly convex</strong> domain $\Omega$. Without strict convexity we can't allow arbitrary continuous boundary data; it must be at least consistent with some convex function in $\Omega$. (But I don't know if that's enough). The uniqueness part holds without strict convexity; see Corollary 1.4.7 in the same book. </p> http://mathoverflow.net/questions/15123/riemann-surface-disconnected-at-infinity/15194#15194 Answer by 002 for Riemann surface disconnected at infinity 002 2010-02-13T16:51:44Z 2010-02-13T16:51:44Z <p>This is an extended version of my comment. Suppose we stay on the surface $z^2+w^2=1$ but away from the origin. The identity $|z^2+w^2|^2=|z|^4+|w|^4+2Re((z \bar w)^2)$  tells us that the square of $z \bar w$ has negative real part. The set of complex numbers $\zeta$ such that $Re(\zeta^2)&lt;0$ has two connected components: it's the disjoint union of two open sectors. Finally, note that switch from (z,w) to (-z, w) involves going from one component to the other. </p> http://mathoverflow.net/questions/1053/what-m-minimizes-em-x3-for-a-random-variable-x/14965#14965 Answer by 002 for What m minimizes E(|m-X|^3) for a random variable X? 002 2010-02-11T02:17:57Z 2010-02-11T02:17:57Z <p>The minimizer $m$ is the nearest point projection of $X$ onto the subspace of $L^p$ formed by the constant functions ($p=3$ in your case). This $m$ is sometimes called the $p$-prediction or $p$-predictor of $X$. Apparently, this terminology began with <a href="http://www.ams.org/mathscinet-getitem?mr=189077" rel="nofollow">Andô and Amemiya</a>. Some of later papers are <a href="http://www.ams.org/mathscinet-getitem?mr=537095" rel="nofollow">Landers and Rogge</a> (who wrote a few other papers, e.g. <a href="http://www.ams.org/mathscinet-getitem?mr=567995" rel="nofollow">this one</a>), and <a href="http://www.ams.org/mathscinet-getitem?mr=894443" rel="nofollow">Cuesta and Matrán</a>. The term "generalized (conditional) expectation" also appeared.</p> http://mathoverflow.net/questions/14781/constraints-on-the-fourier-transform-of-a-constant-modulus-function/14784#14784 Answer by 002 for Constraints on the Fourier transform of a constant modulus function 002 2010-02-09T17:11:36Z 2010-02-09T17:33:39Z <p>If $g$ happens to be in $L^1$, then the amplitude of the Fourier transform of $fg$ is bounded by the $L^1$ norm of $g$, for any unimodular $f$. This is the only restriction from above since you can always choose $f$ so that $fg\ge 0$, thus bringing the (essential) supremum of $\widehat{fg}$ up to $\|g\|_{L^1}$. </p> <p>Another part of the question is how small we can make $A$. I guess "arbitrarily small", but don't have a proof. (Except for special case: if $g$ is in $L^1$, then we can chop it into pieces with disjoint supports and small $L^1$ norm, and then use $f$ to move the Fourier transforms of pieces far from one another.) </p> http://mathoverflow.net/questions/14679/cauchy-product-for-general-case/14700#14700 Answer by 002 for cauchy product for general case 002 2010-02-08T21:30:24Z 2010-02-08T21:30:24Z <p>It's not a problem to multiply the series: the product is $\sum_{(t,k)\in\mathbb Z^2} a_tb_k$. The question is how to sum the double series that we have. </p> <p>For series with nonnegative terms summation is not a problem either: we take the supremum of all finite sums. And since any finite sum is contained in a sufficiently large square, it follows that $\sum_{(t,k)\in\mathbb Z^2} |a_tb_k|$ is finite whenever $\sum_{t\in\mathbb Z} |a_t|$ and $\sum_{k\in\mathbb Z} |b_k|$ are. </p> <p>In general, $\sum_{(t,k)\in\mathbb Z^2} a_tb_k=S$ if for any $\epsilon>0$ there is a finite subset $A\subset \mathbb Z^2$ such that $|\sum_{(t,k)\in B}a_tb_k - S|&lt;\epsilon$ whenever $B$ is finite and $B\supset A$. Now if both given series converge absolutely, then the contribution from outside of a large square is small, and it follows that $S$ is the product of two sums.</p> http://mathoverflow.net/questions/14586/when-can-a-function-be-recovered-from-a-distribution/14591#14591 Answer by 002 for When can a function be recovered from a distribution? 002 2010-02-08T02:52:09Z 2010-02-08T02:52:09Z <p>First of all, $T$ must have order zero, i.e., $|T(\varphi)|\le C(K)\sup|\varphi|$ for any test function $\varphi$ supported on a compact set $K$. By Riesz representation theorem, $T$ is a measure. To be a locally integrable function, it must be absolutely continuous with respect to the Lebesgue measure. One way to express this condition: $C(K)\to 0$ as the Lebesgue measure of $K$ tends to zero, which $K$ staying within a fixed compact set.</p> http://mathoverflow.net/questions/14245/maximizing-sparsity-in-l1-minimization/14461#14461 Answer by 002 for Maximizing Sparsity in l1 Minimization? 002 2010-02-07T04:37:53Z 2010-02-07T05:12:06Z <p>The ultimate sparseness occurs when $Ax^*(\lambda)=0$, which is the case when the minimizer <code>$x^*$</code> is the projection of $b$ onto $\ker A$. For this to happen, $\lambda$ must be small enough so that the restriction of $A$ to the orthogonal complement of its kernel is bounded from below by a constant greater than <code>$2\lambda \mathrm{dist}(b,\ker A)$</code>. Here the lower bound for operator is understood in the <code>$\ell^2\to\ell^1$</code> norm.</p> http://mathoverflow.net/questions/12298/bernstein-inequality-for-multivariate-polynomial/12319#12319 Answer by 002 for Bernstein inequality for multivariate polynomial 002 2010-01-19T16:37:20Z 2010-01-19T16:37:20Z <p>Tung, S. H. Bernstein's theorem for the polydisc. Proc. Amer. Math. Soc. 85 (1982), no. 1, 73--76. MR0647901 (83h:32017)</p> <p>(from MR review): Let $P(z)$ be a polynomial of degree $N$ in $z=(z_1,\cdots,z_m)$; suppose that $|P(z)|\leq 1$ for $z\in U^m$; then $\|DP(z)\|\leq N$ for $z\in U^m$ where $\|DP(z)\|^2=\sum_{i=1}^m|\partial P/\partial z_i|^2$. </p> <p>Here $U^m$ is the polydisc. Same author proved Bernstein-type inequality for the ball, Tung, S. H. Extension of Bernšteĭn's theorem. Proc. Amer. Math. Soc. 83 (1981), no. 1, 103--106. MR0619992 (82k:32013)</p> http://mathoverflow.net/questions/12249/baire-category-theorem/12253#12253 Answer by 002 for Baire category theorem 002 2010-01-18T23:14:55Z 2010-01-18T23:14:55Z <p>Maybe if you allow an exceptional set, as in "For every $x$ outside of some meagre set, there is a <code>$\delta&gt;0$</code> such that $B(x,\delta)$ is contained in one of the <code>$\overline{A}_n$</code>" </p> <p>(Indeed, the set of all $x$ where the above fails is a closed subset of $X$ with empty interior.)</p> http://mathoverflow.net/questions/11923/sets-that-can-be-mapped-onto-rn-by-a-polynomial Sets that can be mapped onto R^n by a polynomial 002 2010-01-15T21:29:42Z 2010-01-18T05:13:57Z <p>The question was edited several times. Most recent version, suggested by Fedja:</p> <blockquote> <p>Does there exist an open set $U\subset \mathbb R^n$ <code>(n&gt;1)</code> that contains balls of arbitrarily large radius and such that no polynomial mapping $p\colon \mathbb R^n\to\mathbb R^n$ takes $U$ onto $\mathbb R^n$? (Take $n=2$ if you prefer.)</p> </blockquote> <p><hr /></p> <p>Older version (with bounty) was answered by Fedja in the affirmative: </p> <blockquote> <p>Does there exist a topological ball $U\subset \mathbb R^n$ of infinite volume such that no polynomial mapping $p\colon \mathbb R^n\to\mathbb R^n$ takes $U$ onto $\mathbb R^n$?</p> </blockquote> <p><hr /></p> <p>Discussion: </p> <p>Motivated by a <a href="http://mathoverflow.net/questions/11904/a-polynomial-map-from-n-to-n-mapping-the-positive-orthant-onto-n" rel="nofollow" title="question">recent question</a>, I wonder if there is a geometric characterization of open sets $U\subset \mathbb R^n$ that can be mapped onto $\mathbb R^n$ by a polynomial $p$. Let $U$ be a topological ball to simplify matters. The following <em>tail volume condition</em> is necessary for the existence of such $p$.</p> <p>(TVC) <code>$\int_1^{\infty} r^{m} |U\setminus B(r)|=\infty$</code> for some $m>0$. </p> <p>Indeed, the absolute value of the Jacobian of $p$ must have infinite integral over $U$. Since the Jacobian is a polynomial, <code>$\int_U |x|^N dx=\infty$</code> for some $N$. The latter can be rephrased in terms of tail volume: <code>$\int_1^{\infty} r^{N-1} |U\setminus B(r)| =\infty$</code>. The example of <code>$U=\{(x,y)\in \mathbb R^2\colon x&gt;1, 0&lt;y&lt;x^{-M}\}$</code> shows that (TVC) is somewhat sharp. This particular $U$ can be mapped onto $\mathbb R^2$ by $(x,y)\mapsto (x,x^{M+1}y)$ followed by translation and the power map $(x+iy)\mapsto (x+iy)^8$.</p> <p>I am interested in other obstructions besides small tail volume, as well as in reasonably general sufficient conditions. Initially I hoped to get a stronger necessary condition from an affirmative answer to the question below, but Bjorn Poonen answered it in the negative. </p> <p>"If $f\colon U\to\mathbb R^n$ is a polynomial surjection, does there exist <code>$\epsilon&gt;0$</code> such that $p(U\cap B(r))$ contains $B(r^\epsilon)$ for large $r$?" </p> http://mathoverflow.net/questions/11691/asymptotics-of-iterated-polynomials/11707#11707 Answer by 002 for Asymptotics of iterated polynomials 002 2010-01-13T23:04:21Z 2010-01-13T23:04:21Z <p>Have you tried the method of section 8.7, i.e., solving Abel's equation $\phi(P(x))-\phi(x)=1$? Here we expect <code>$\phi(t)=t^{-1}+\sum_{n=1}^{\infty}c_n t^n$</code>, and you can find the coefficients of $\phi$ one by one. For example, I took $P(x)=x-x^2+x^3+x^4$ and immediately found <code>$c_1=-2$</code>, <code>$c_2=-5/2$</code>, <code>$c_3=-7/2$</code>, <code>$c_4=-17/4$</code>... Not a general formula, but you can get as many terms as you want for a given $P$.</p> http://mathoverflow.net/questions/11558/taylor-series-of-a-complex-function-that-is-not-holomorphic/11568#11568 Answer by 002 for Taylor series of a complex function that is not holomorphic 002 2010-01-12T17:49:15Z 2010-01-12T17:49:15Z <p>Another option is $\sum c_{mn}z^m \bar z^n$, which still keeps track of the complex structure. For instance, harmonic functions will have $c_{mn}=0$ unless $mn=0$.</p> http://mathoverflow.net/questions/11495/notation-for-the-inclusion-map-is-a-homotopy-equivalence Notation for "the inclusion map is a homotopy equivalence" 002 2010-01-12T03:07:10Z 2010-01-12T03:33:06Z <p>It's sometimes convenient to have different notations for "$A$ is a subset of $B$" depending on what the inclusion map does:</p> <ol> <li>If it's non-surjective, $A\subsetneq B$ or $A\subset B$, depending on your religion</li> <li>If it's surjective, $A=B$ :)</li> <li>If the image is a precompact set, $A\Subset B$</li> </ol> <p>Does there exist notation to indicate that the inclusion $A\hookrightarrow B$ is a homotopy equivalence? I'd like to use something similar to 1-3.</p> http://mathoverflow.net/questions/10793/compact-convex-sets-and-extreme-points/10795#10795 Answer by 002 for Compact Convex sets and Extreme Points 002 2010-01-05T07:38:48Z 2010-01-05T07:38:48Z <p>By definition, a non-extreme boundary point lies on an open line segment contained in the set, which happens to be an open subset of the boundary in two dimensions. Hence the set of extreme points is a closed subset of the boundary.</p> http://mathoverflow.net/questions/6253/lebesgue-measure-of-boundary-of-caccioppoli-set/10766#10766 Answer by 002 for Lebesgue measure of boundary of Caccioppoli set 002 2010-01-05T02:10:35Z 2010-01-05T02:10:35Z <p>The answer is no. Take countably many disjoint closed balls <code>$B_i$</code> contained in the square $Q=[0,1]\times [0,1]$ and such that:<br /> (i) Sum of areas of <code>$B_i$</code> is less than 1<br /> (ii) Sum of perimeters of <code>$B_i$</code> is finite<br /> (iii) <code>$\bigcup B_i$</code> is dense in $Q$<br /> Since the series <code>$\sum \chi_{B_i}$</code> converges in BV norm, the set <code>$E=Q\setminus \bigcup B_i$</code> has finite perimeter. It also has positive measure and empty interior. Any representative $F$ of the set $E$ also has empty interior and therefore $\partial F$ is not Lebesgue null.</p> <p><hr /></p> <p>By the way, any Lebesgue measurable set E has a representative F with the property </p> <p>(*) $0&lt;|F\cap B(x,r)|&lt;|B(x,r)|$ for all $x\in\partial F$ and all $r>0$. </p> <p>The proof is straightforward: add the points x for which $|E\cap B(x,r)|=|B(x,r)|$ for some r, and throw out all points x such that $|E\cap B(x,r)|=0$ for some $r$. (See Prop. 3.1 in "Minimal surfaces and functions of bounded variation" by E. Giusti.) By virtue of (*) the set $F$ has the smallest (w.r.t inclusion) topological boundary among all representatives of $E$, so if this representative doesn't help you, nothing does. </p> http://mathoverflow.net/questions/10567/number-of-uniform-rvs-needed-to-cross-a-threshold/10568#10568 Answer by 002 for Number of uniform rvs needed to cross a threshold 002 2010-01-03T07:24:36Z 2010-01-03T07:24:36Z <p>Another way to put it: the expected value of the sum right after it crosses x is x+1/3. If you simply conditioned the sum to be in (x,x+1) then the expectation would be about x+1/2, with the sum almost uniformly distributed. But you also condition on the overshoot being less than the last jump. The expectation of the smaller of two uniform [0,1] iids is 1/3.</p> http://mathoverflow.net/questions/10344/the-orthodrome-of-n-spheres/10345#10345 Answer by 002 for The orthodrome of n-spheres. 002 2010-01-01T03:04:38Z 2010-01-01T03:04:38Z <p>The two-dimensional formula applies (why?): the great-circle distance is $\cos^{-1}(\vec u\cdot \vec v)$ where $\vec u$ and $\vec v$ are position vectors of the points. </p> http://mathoverflow.net/questions/7732/diameter-of-m-fold-cover/21364#21364 Comment by 002 002 2010-04-14T18:03:37Z 2010-04-14T18:03:37Z This is a question, not an answer, and should be posted as such (with a link to Anton's question). http://mathoverflow.net/questions/20449/does-it-generate-a-sequence-of-univalent-functions/20581#20581 Comment by 002 002 2010-04-07T17:25:57Z 2010-04-07T17:25:57Z And then I deleted the clarification and put the proof together. http://mathoverflow.net/questions/20449/does-it-generate-a-sequence-of-univalent-functions/20581#20581 Comment by 002 002 2010-04-07T03:21:21Z 2010-04-07T03:21:21Z @miwalin I added a clarification. http://mathoverflow.net/questions/16771/lower-bounds-on-truncated-fourier-transform-of-functions-of-constant-modulus-an/16774#16774 Comment by 002 002 2010-04-07T01:58:49Z 2010-04-07T01:58:49Z @timur: integration over $k$ appears in the statement of the problem. http://mathoverflow.net/questions/16771/lower-bounds-on-truncated-fourier-transform-of-functions-of-constant-modulus-an/16774#16774 Comment by 002 002 2010-03-02T02:14:38Z 2010-03-02T02:14:38Z I just thought it would be easier to deal with the sum than the product. You are right about the singularity; for small k one should use another estimate such as $|\hat f(k)|\le 1$. http://mathoverflow.net/questions/15188/perimeter-area-of-finite-union-of-unitsquares-le-4/15268#15268 Comment by 002 002 2010-02-15T20:55:26Z 2010-02-15T20:55:26Z -1 to bring the total of votes to 0 and return the problem to the &quot;Unanswered&quot; category where it belongs. http://mathoverflow.net/questions/14506/are-the-pearson-and-spearman-rank-correlation-coefficients-related-in-a-specific/14573#14573 Comment by 002 002 2010-02-13T23:13:09Z 2010-02-13T23:13:09Z For <i>independent</i> RVs it's true because correlation is zero. http://mathoverflow.net/questions/14998/is-a-function-which-is-finitely-multiple-valued-in-each-variable-separately-also/15066#15066 Comment by 002 002 2010-02-12T16:03:23Z 2010-02-12T16:03:23Z Another fix is to use `$\Omega=\{|z|^2&lt;\mathrm{Re} w\}$' (Siegel half-space) which is strictly pseudoconvex and is therefore the domain of holomorphy for some function $g$. Then add square roots to $g$ as above. http://mathoverflow.net/questions/14701/reflection-formula-for-lerch-zeta-function Comment by 002 002 2010-02-08T22:52:51Z 2010-02-08T22:52:51Z Something like this? <a href="http://functions.wolfram.com/ZetaFunctionsandPolylogarithms/LerchPhi/17/02/01/01/0001/" rel="nofollow">functions.wolfram.com/&hellip;</a> http://mathoverflow.net/questions/14506/are-the-pearson-and-spearman-rank-correlation-coefficients-related-in-a-specific/14573#14573 Comment by 002 002 2010-02-08T02:17:26Z 2010-02-08T02:17:26Z That's not my understanding either. I meant the following: if $(x_1,\dots, x_n)$ is a permutation of an arithmetic progression, then the rank of $x_i$ is a linear (or rather affine) function of $x_i$. http://mathoverflow.net/questions/14506/are-the-pearson-and-spearman-rank-correlation-coefficients-related-in-a-specific/14573#14573 Comment by 002 002 2010-02-08T00:08:19Z 2010-02-08T00:08:19Z Actually, it seems that $\rho=r$ for uniform random variables. Indeed, $\rho$ is by definition $r$ for the ranks, and for uniform distributions rank is a linear function of the variable itself. http://mathoverflow.net/questions/14280/a-strong-convergence Comment by 002 002 2010-02-05T17:52:08Z 2010-02-05T17:52:08Z @Gerald: Radius of convergence greater than 1 would work (assuming f is analytic. For a sequence, uniform convergence on a disk of such radius is enough. http://mathoverflow.net/questions/14280/a-strong-convergence/14287#14287 Comment by 002 002 2010-02-05T16:18:22Z 2010-02-05T16:18:22Z No, uniform convergence of coefficients does not imply convergence of derivatives even when the functions themselves converge uniformly. E.g. $n^{-1/2}x^n$ on [-1,1]. http://mathoverflow.net/questions/12312/area-of-the-star-of-the-difference-set Comment by 002 002 2010-02-05T00:33:57Z 2010-02-05T00:33:57Z The origins of this problem may have something to do with a survey article by T.H. MacGregor (1972), where the following is proved. Let A=f(D) where D is the unit disk and f:D-&gt;A is a holomorphic function with |f'(0)|=1. Then A-A contains the disk |z|&lt;\pi/2. http://mathoverflow.net/questions/13479/which-local-homeos-to-numerical-space-are-bijective/13535#13535 Comment by 002 002 2010-02-01T20:27:02Z 2010-02-01T20:27:02Z @ Georges: then the answer is yes. Since X is a one-dimensional manifold, it's either R or S^1. It can't be S^1 because then the image would be compact. Any locally invertible map R-&gt;R is globally invertible.