User - MathOverflow most recent 30 from http://mathoverflow.net 2013-05-24T11:44:18Z http://mathoverflow.net/feeds/user/20554 http://www.creativecommons.org/licenses/by-nc/2.5/rdf http://mathoverflow.net/questions/92119/duality-of-eta-product-identities-a-new-idea Duality of eta product identities: a new idea? spanferkel 2012-03-25T00:07:41Z 2012-08-28T16:22:00Z <p>Looking at the collection of <a href="http://eta.math.georgetown.edu/" rel="nofollow">Eta Function Product Identities by Michael Somos</a>, it seems like generally those identities come in pairs: let's call two eta product identities $\sum\limits_{i=1}^r a_iP_i=0$ and $\sum\limits_{i=1}^r b_iQ_i=0$ <strong><em>dual</em></strong> if the eta products $Q_i$ can be re-labeled and the factors of each product re-arranged such that for all $i$, we can transform $P_i$ into $Q_i$ by replacing each argument $q^k$ or $k\tau$ of an eta function ($k\in\mathbb N$) by $q^{n/k}$ or $(n/k)\tau$. Note that the scalar coefficients $a_i$ and $b_i$ need not be the same, but they should be non-zero of course.</p> <p>Example: The first two identities on <a href="http://eta.math.georgetown.edu/etaL/L14.txt" rel="nofollow">the n=14 page</a>, both of degree $12$, are </p> <pre><code>q14_12_44 = +1*u1^7*u2*u7^3*u14 +7*q*u1^3*u2*u7^7*u14 -1*u2^8*u7^4 -7*q^3*u1^4*u14^8 ; q14_12_64 = +1*u1^8*u14^4 +7*u2^4*u7^8 -56*q^2*u1*u2^3*u7*u14^7 -8*u1*u2^7*u7*u14^3 ; </code></pre> <p>re-arranged and written in a more humanly-readable form, putting $s_k=\eta(k\tau)$, we have </p> <p>q14_12_44$\iff\qquad s_1^7s_2^{\ }s_7^3s_{14}^{\ } +7s_1^3s_2^{\ }s_7^7s_{14}^{\ } -s_2^8s_7^4 -7s_1^4s_{14}^8=0$</p> <p>q14_12_64$\iff -56s_{14}^7s_7^{\ }s_2^3s_1^{\ }-8s_{14}^3s_7s_2^7s_1^{\ } +7s_7^8s_2^4+s_{14}^4s_1^8=0$</p> <p>so both identities are duals of each other. </p> <blockquote> <p>It should be easy to see that an eta product identity <em>(edit: which is not dual to itself)</em> cannot have two (linearly independant) duals. Is that really easy to see?</p> </blockquote> <p>An eta product identity can also be <strong><em>self-dual</em></strong>, e.g. the known <a href="http://mathoverflow.net/questions/91672/linear-eta-product-identities-how-many-are-there" rel="nofollow">linear identities mentioned in my recent MO thread</a> or the one equivalent to the well-known theta identity $\theta_3^4(q) = \theta_4^4(q) + \theta_2^4(q)$, which becomes, when written in terms of $\eta$'s, $$s_2^{24}=s_1^{16}s_4^8 +16s_4^{16}s_1^8 .$$</p> <blockquote> <p>This concept of duality seems so logical that I wonder: Has there already been any research on that? Has each eta product identity a dual counterpart, unless it is self-dual ?</p> </blockquote> <p>In the collection mentioned above, for $n=22$ there is only one identity listed, and that one is not self dual, it is even highly asymmetrical. Its dual should have the label x22_19_124. Maybe that one is missing just because the computer search had to stop at some point.</p> <blockquote> <p>Given that self-dual identities have a higher degree of symmetry: can they always be expressed in terms of Ramanujan's psi, phi, and/or chi functions? </p> </blockquote> <p>I would think the answer is yes, as there are even some not self-dual ones that can be expressed in that way.</p> <p><strong>Edit concerning the first question:</strong> Even this may be trickier than expected. For example, there are two self-dual identities, labeled q6_14_36a and q6_14_36b. They are:</p> <p>$s_1^9s_3^{\ }s_6^4 +\ \ 6s_1^4s_2^{\ }s_6^9 +2s_2^9s_3^4s_6^{\ } -3s_1^{\ }s_2^4s_3^9=0$ </p> <p>$s_1^9s_3^{\ }s_6^4 +12s_1^4s_2^{\ }s_6^9 -4s_2^9s_3^4s_6^{\ } +3s_1^{\ }s_2^4s_3^9=0$. </p> <p>They contain exactly the same $\eta$-products and so can also be considered as dual to each other (and to linear combinations of them). Moreover, by linear combinations we may eliminate any one of the four terms, resulting in four 3-term identities with coefficients </p> <pre><code> 0 1 -1 1 -1 0 -8 9 1 8 0 -1 -1 -9 1 0. </code></pre> <p>Note that each of those has exactly one dual counterpart again, as they come in two dual pairs.<br> So the above conjecture of a unique dual doesn't necessarily hold if the given identity is already self-dual.</p> http://mathoverflow.net/questions/86864/when-can-a-family-of-polynomials-get-a-weight-function-to-be-made-orthogonal When can a family of polynomials get a weight function to be made orthogonal? spanferkel 2012-01-27T22:35:16Z 2012-07-20T06:27:31Z <p>Let $\lbrace P_n(z)\rbrace_{n\in\mathbb N_0}$ be a family of polynomials defined by a generating function $g(t,z)=\sum\limits_{n=0}^\infty P_n(z)t^n$ or by a contour integral $P_n(z)=\frac1{2\pi i}\oint\frac{g(t,z)}{t^{n+1}}dt$. Are there known sufficient conditions on $g$ or on the $P_n$ themselves that guarantee the existence of a weight function $w:I\to \mathbb R^+_0$ (where $I\subset\mathbb R$ is an appropriate interval) such that the $P_n$ are orthogonal w.r.t. $w$?</p> http://mathoverflow.net/questions/91672/linear-eta-product-identities-how-many-are-there Linear eta product identities - how many are there? spanferkel 2012-03-19T22:47:22Z 2012-03-19T22:47:22Z <p>For the Dedekind eta function, defined as usual by $\eta(q) = q^{\frac1{24}} \prod\limits_{n=1}^{\infty} (1-q^{n})$, let for brevity $e_k:=\eta(q^k)$. With this notation, <a href="http://cis.csuohio.edu/~somos/retaprod.pdf" rel="nofollow">a blog entry of Michael Somos</a> gives three beautiful identities for sums of $\eta$-products where all exponents are only $0$ or $1$:</p> <p>$I_{60}:\qquad \ \ e_{1}e_{12}e_{15}e_{20} + e_{3}e_{4}e_{5}e_{60}=e_{2}e_{6}e_{10}e_{30}$</p> <p>$I_{210}:\qquad e_{1}e_{30}e_{35}e_{42 }+ e_{3}e_{10}e_{14}e_{105} = e_{2}e_{15}e_{21}e_{70} +e_{5}e_{6}e_{7}e_{210}$</p> <p>$I_{30}:\qquad\ \ e_{1}e_{3}e_{5}e_{15}+ 2e_{2}e_{6}e_{10}e_{30}=e_{1}e_{2}e_{15}e_{30}+ e_{3}e_{5}e_{6}e_{10}$</p> <p>For $I_{60}$ and $I_{30}$ the structure is clear at one glance if we write the divisors of $60$ as vertices of a Cayley-like graph (here: 'union' of two cube graphs $Q_3$ with the common face $(2,6,30,10)$ ):</p> <pre><code>4 20 2 10 1 5 3 15 6 30 12 60 </code></pre> <p>Alternatively, if we define </p> <p>$a_0:=e_{1} e_{15} \qquad b_0:= e_{3} e_{5}$ </p> <p>$a_1:=e_{2} e_{30} \qquad b_1:= e_{6} e_{10}$ </p> <p>$a_2:=e_{4} e_{60} \qquad b_2:= e_{12} e_{20}$ </p> <p>then </p> <p>$I_{60}\iff a_0b_2+b_0a_2=a_1b_1$ </p> <p>$I_{30}\iff a_0a_1+b_0b_1=a_0b_0+2a_1b_1$. </p> <p>For $I_{210}$ the symmetry is a bit less obvious to see. We can identify the divisors of $210$ with the vertices of a tesseract graph $Q_4$ or write the factors of the four products as lines of a matrix and note $a_{i,j}a_{4-i,j}=210$ as well as the factor $3$ between the two pairs of lines:</p> <pre><code> 1 30 35 42 3 10 105 14 70 21 2 15 210 7 6 5 </code></pre> <blockquote> <p>I'd suggest to call identities of this type <strong>linear eta product identities</strong>. Their linearity seems to enforce a high degree of symmetry in the way these three identities $I_n$ feature the divisors of $n$, which makes them very special among the thousands of known eta product identities. <em>It looks like there is something deeper behind</em>. And: <em>Why do all products have exactly $4$ factors?</em></p> </blockquote> <p>So, more precisely, for naturals $a\ge b$ let's define a <strong>linear eta product identity of type</strong> $\mathbf{(a,b)}$ as an identity $L_1+\cdots+L_a=R_1+\cdots+R_b$, where each $L_i$ and each $R_i$ is a finite product of pairwise different terms of form $\eta(q^{\lambda})$ with $\lambda\in\mathbb N$. (The products $L_i$ and $R_i$ don't need to be all different, e.g. the above $I_{30}$ is of type $(3,2)$ with $L_2=L_3$. But of course we want $\{L_i\}\cap\{R_i\}=\emptyset$, and also that the gcd of all the $\lambda$'s is $1$.)<br> Somos conjectures that $I_{60}$ is the only linear identity of type $(2,1)$.</p> <blockquote> <p>Is it possible that the three above identities are only the first ones of a whole (infinite?) set of linear eta product identities, and/or that for naturals $a\ge b$, there is at most one such identity of type $(a,b)$?</p> </blockquote> http://mathoverflow.net/questions/90904/any-relationship-between-viswanaths-constant-and-the-khinchine-levy-constant Any relationship between Viswanath's constant and the Khinchine-Lévy constant? spanferkel 2012-03-11T14:07:45Z 2012-03-13T15:52:23Z <p>It is well-known that if ${\{{F_n}\}}$ is a <a href="http://en.wikipedia.org/wiki/Random_Fibonacci_sequence" rel="nofollow">random Fibonacci sequence</a> then we have almost certainly $\lim \limits_{n\to\infty}\sqrt[n]{|F_n|}=\tau$ where $\tau\approx 1.554682275$ is <a href="http://www.ams.org/journals/mcom/2000-69-231/S0025-5718-99-01145-X/home.html" rel="nofollow">Viswanath's constant</a>. There is also a <a href="http://www.americanscientist.org/issues/pub/the-vibonacci-numbers/1" rel="nofollow">simplified version</a> of Viswanath's proof with some more motivation.</p> <p>Now, the <a href="http://mathworld.wolfram.com/Khinchin-LevyConstant.html" rel="nofollow">Khinchine-Lévy constant</a> $\gamma=e^{\pi^2/(12\ln2)}$ (sometimes also called Lévy constant) is obtained in a quite similar way as $\lim \limits_{n\to\infty}\sqrt[n]{q_n}$ for almost all reals $x$, where $\frac{p_n}{q_n}$ is the $n$th convergent of the continued fraction of $x$. (Note that we might as well take $\lim \limits_{n\to\infty}\sqrt[n]{p_n}$.)<br> So the question:</p> <blockquote> <p><strong>Is there a relationship between Viswanath's constant and the Khinchine-Lévy constant?</strong></p> </blockquote> http://mathoverflow.net/questions/90753/a-limit-by-gosper-involving-a-product-of-arctan-and-41-pi a limit by Gosper involving a product of arctan and $4^{1/\pi}$ spanferkel 2012-03-09T19:33:49Z 2012-03-10T01:46:53Z <p>On the <a href="http://mathworld.wolfram.com/PiFormulas.html" rel="nofollow">Wolfram page about pi formulas</a>, there is this curious limit by R. W. Gosper (130) $$\lim\limits_{n\to\infty}\prod\limits_{k=n}^{2n}\dfrac{\pi}{2\arctan k}=4^{1/\pi}.$$</p> <p>The only reference given is an entry from 1996 in some forum. Has anybody a proof or reference for this or similar formulas?</p> http://mathoverflow.net/questions/86573/minimal-polynomials-of-trig-functions-of-k-pi-p-and-divisibility-of-coeffici minimal polynomials of trig functions of ($k \pi/p$) and divisibility of coefficients by p spanferkel 2012-01-24T21:27:47Z 2012-03-07T21:22:00Z <p>Take an odd prime $p$ and put $x_0:=\sum\limits_{j=0}^{p-1}\left(a_{j}\sqrt{p}\cos\dfrac{j\pi}p+b_{j}\sin\dfrac{j\pi}p +c_{j}\tan\dfrac{j\pi}p\right)$, where the $a_{ij}$ are integers. If $f$ denotes the minimal polynomial of $x_0$, can we <strong>prove that $p$ divides all coefficients of $f$ except the leading one</strong>? </p> <p>I have quite a bit of numerical evidence for this. Note that it obviously doesn't hold without the $\sqrt p$ factor, but more interestingly, it is also false if $\sqrt p$ goes with the other terms instead of the $\cos$ term. Moreover, it seems that in those cases, <em>none</em> of the non-zero coefficients is divisible by $p$.</p> <p>(More generally, I think those coefficients are divisible by $p$ if we replace $\dfrac{j\pi}p$ by $\dfrac{j\pi}{p^r},\ r\in\mathbb N$ and do the sum over $j=0,...,p^r-1$.)</p> <p>If all but one of the $a_j,b_j,c_j$ are $0$, the claim is quite easy to prove (and not new). For instance, for $x_0=\sin\dfrac{j\pi}p$ with any fixed $j$, we have explicitly $$f(x)=\sum\limits_{i=0}^k(-1)^k\dbinom p{2i+1}(1-x^2)^{k-i}x^{2i},$$ where $p=2k+1$. So the claim is obvious here.</p> <p><strong>Added:</strong> <em>It should be clear from Galois theory that in general, the conjugates of $x$ are the sums obtained by replacing all the $j$'s by $kj$ for a fixed $k=2,...,p-1$.</em></p> <p><strong>Literature:</strong> </p> <p>Beslin, S., de Angelis, V., 2004. The minimal polynomials of sin(2π/p) and cos(2π/p). Mathematical Magazine 77, 146–149.</p> <p>Heierman, William E., <a href="http://www.corunduminium.com/Trigpolys.html" rel="nofollow">Minimal polynomials for trig functions of angles rationally commensurate with π</a></p> <p>Lang, Wolfdieter, <a href="http://www-itp.particle.uni-karlsruhe.de/~wl/EISpub/A181872.pdf" rel="nofollow">Minimal Polynomials of sin (2π/n)</a></p> <p>Surowski, David, and McCombs, Paul, <a href="http://www.math.ksu.edu/~dbski/preprints/cosine-mo-jo.pdf" rel="nofollow">Homogenous polynomials and the minimal polynomial of cos(2π/n)</a></p> <p>W. Watkins and J. Zeitlin, <a href="http://www.jstor.org/stable/2324301" rel="nofollow">The Minimal Polynomial of cos(2Pi/n)</a>, Am. Math. Monthly 100,5 (1993) 471-4.</p> http://mathoverflow.net/questions/89996/why-are-some-q-analogues-more-canonical-than-others Why are some q-analogues more canonical than others? spanferkel 2012-03-01T23:25:27Z 2012-03-02T17:37:27Z <p>It is striking that some q-analogs of functions, operators, identities and especially whole theorems seem quite "canonical", e.g.</p> <ul> <li>the factorial and the q-Gamma function</li> <li>the basic hypergeometric series (at least $_{r+1}\Phi_r$ and $_{r}\Psi_r$)</li> <li><a href="http://mathworld.wolfram.com/q-Pi.html" rel="nofollow">q-Pi and the q-Wallis formula</a></li> </ul> <p>In a strict sense, q-analogs can of course not be canonical, as we might throw in almost everywhere powers of $q$ without changing the limit if $q\to1$. </p> <blockquote> <p>I mean <strong><em>canonical</em></strong> in the sense that these are the forms that require the least extra powers of $q$, or, more importantly, that other q-identities/theorems using them also tend to avoid such extra powers at best, making the formulae shorter.</p> </blockquote> <ul> <li><em><strong>Does it really make sense to call these (and certain other) q-analogs "canonical"? And if so, is there an explanation why some are much more canonical than others?</em></strong></li> </ul> <p>(Or is there a better definition of canonical?)</p> <p>The canonicity of the <em>q-binomial coefficients</em> is obviously accounted for by their relationship with linear subspaces. (So this is not an analytical criteria using the limit $q\to1$.) </p> <p>What about the <em>q-Gamma function</em>? We may consider it canonical because of the (?!) q-analogue of the Bohr-Mollerup theorem proved by R. Askey, which states that for $0\lt q\lt 1$, the only logarithmically convex function satisfying $f(1)=1$ and $f(x+1)=\frac{q^x –1}{q–1}f(x)$ is the q-gamma function $\Gamma_q(z)=(1-q)^{1-x} \frac{(q\;;\; q)_{\infty}}{{(q^x;\; q) _\infty }}.$</p> <p>Also note that this formula looks at least as elegant as Euler's definition of $\Gamma(z)= \dfrac{1}{z} \prod\limits_{n=1}^\infty \frac{\left(1+\frac{1}{n}\right)^z}{1+\frac{z}{n}}.$ </p> <p>On the other hand, one of the most basic identities, the recursion of binomial coefficients, has only an "asymmetric" q-analog and thus two of them: ${\genfrac[]00{n}{k}}_q=q^k{\genfrac[]00{n-1}{k}}_q+{\genfrac[]00{n-1}{k-1}}_q={\genfrac[]00{n-1}{k}}_q+q^{n-k}{\genfrac[]00{n-1}{k-1}}_q$.</p> <p>For the <em>classical orthogonal polynomials</em>, it looks like there exist systematically "nice" q-analogs (see e.g. <a href="http://homepage.tudelft.nl/11r49/documents/as98.pdf" rel="nofollow">this survey</a>), but it is not clear if there is a certain sense in which those can be considered canonical. Maybe for the Chebyshev polynomials, <a href="http://arxiv.org/ftp/arxiv/papers/1201/1201.4703.pdf" rel="nofollow">there is one "best" q-analog.</a></p> <ul> <li><p><strong>Is there a reasonable way of considering certain q-analogs of orthogonal polynomials "canonical", e.g. their uniqueness w.r.t. to an appropriate criteria, as for most classical orthogonal polynomials?</strong></p></li> <li><p><strong>Has a q-analog of a polynomial identity (e.g. involving binomial coefficients) more chances of being canonical if it has a combinatorial interpretation?</strong></p></li> </ul> <p>For the q-derivative, there are at least two completely different approaches, both with their merits. So there is no use looking for canonicity there.<br> But nevertheless the next question:</p> <ul> <li><strong>Are q-analogs conceptually similar to an extension from $\mathbb R$ to $\mathbb C$?</strong></li> </ul> <p>By the latter I mean the following:<br> I wonder if generally speaking, the shift from an entity to its q-analog(s) can be likened, at least sometimes, to the shift of passing from $\mathbb R$ to $\mathbb C$, in the sense that some q-analogs provide a more complete picture than the entity itself (cp. for the $\mathbb R\to\mathbb C$ case the fundamental theorem of algebra or the meromorphic extension of the zeta function)? </p> <ul> <li><p>Many features in $\mathbb C$, e.g. the residue theorem, cannot be reduced to $\mathbb R$. Likewise for example, identities of "infinite q-polynomials" (i.e. of generating functions), cannot be taken to the limit $q\to1$.</p></li> <li><p>In situations where there are several useful q-analogs, e.g. for the <a href="http://mathworld.wolfram.com/q-ExponentialFunction.html" rel="nofollow">q-exponential function</a> or the <a href="http://mathworld.wolfram.com/q-Cosine.html" rel="nofollow">q-cosine</a>, we might consider those corresponding to different panes of a Riemann surface like the one of $\sqrt{z}$ or $\ln z$.</p></li> <li><p>And we can take it further:<br> The next step after $\mathbb R$ to $\mathbb C$ are the quaternions.<br> The next step after q-analogs are <a href="http://www.emis.de/journals/INTEGERS/papers/i29/i29.pdf" rel="nofollow">p,q-analogs</a>. It looks like they haven't been studied a lot yet. </p></li> </ul> <p>Thank you for reading me so far.<br> Some of the questions may be rather subjective. As for the title, I had thought at first about "Why are most q-analogues canonical?" But then I figured that in the whole ocean of q-analogues, maybe there are just some "very" canonical islands, but for the vast majority the notion of canonicity is more or less fuzzy. Is that a feasible perception? Even though some of these thoughts are somewhat philosopical, anyway, here goes. Looking forward to your input!</p> http://mathoverflow.net/questions/89238/arrangement-of-integers-1-k2-in-kk-grid-to-minimize-energy-function/89383#89383 Answer by spanferkel for Arrangement of integers 1..k^2 in k*k grid to minimize energy function spanferkel 2012-02-24T11:21:10Z 2012-02-24T11:21:10Z <p>This is not an answer but too long for a comment. It is a heuristical argument that $\frac{k+1}2$ should be best possible.</p> <p>It is easy to see that for an optimal arrangement, $1$ and $k^2$ must both occupy corners. Supposing opposite corners, consider the (monotone) lattice paths between them. Each path covers $2(k-1)$ of the differences we are looking for, so the average difference of those is at least $\frac{k^2-1}{2(k-1)}=\frac{k+1}2$ for each such path (equal if the numbers on the path are strictly increasing, greater otherwise).</p> <p>This is not a proof because summing over all those paths, the differences are not counted equally often. But maybe it can be made into a proof. Problem: if the corners of $1$ and $k^2$ are <em>not</em> opposite, such an argument won't work.</p> <p>The torus case seems harder, it looks like optimal constuctions may be different for even and odd $k$.</p> http://mathoverflow.net/questions/87551/can-elliptic-integral-singular-values-generate-cubic-polynomials-with-integer-coe Can elliptic integral singular values generate cubic polynomials with integer coefficients? spanferkel 2012-02-04T22:20:34Z 2012-02-19T01:07:10Z <p>For the elliptic integral of first kind, $K(m)=\int_0^{\pi/2}\frac{d\theta}{\sqrt{1-m^2sin^2\theta}}$, it is well-known that $K(m)$ can be expressed in what Chowla and Selberg call "finite terms" (i.e. algebraic numbers and a finite product of Gamma functions of rational values) whenever $i\frac{K(\sqrt{1-m^2})}{K(m)}$ belongs to an imaginary quadratic field $\mathbb Q(\sqrt{d})$ (see Theorem 7 in S. Chowla and A. Selberg, <a href="http://www.ncbi.nlm.nih.gov/pmc/articles/PMC1063041/pdf/pnas01544-0031.pdf" rel="nofollow">On Epstein's zeta function, J. reine angew. Math. 227, 86-110, 196</a>). </p> <p>Examples for these so called <strong>elliptic integral singular values</strong> are given on <a href="http://mathworld.wolfram.com/EllipticIntegralSingularValue.html" rel="nofollow">this Wolfram page</a> (with some small typos) and in the note of J.M. Borwein and I.J. Zucker, "Elliptic integral evaluation of the Gamma function at rational values of small denominator," <a href="http://web.cs.dal.ca/~jborwein/Preprints/Books/EMA/Exercises/For%2520others/K-beta.pdf" rel="nofollow">IMA Journal on Numerical Analysis, 12 (1992), 519- 526</a>. </p> <p>See also what Tito Piezas has to say about this in his pleasant-to-read <a href="http://https://sites.google.com/site/tpiezas/0026" rel="nofollow">Collection of Algebraic Identities</a>.</p> <p>The following question arises: </p> <ul> <li><strong>For these singular values, is there</strong> (always, or, if not always: when?) <strong>a polynomial $P(t)$ of degree 3 with <em>integer</em> coefficients such that $K(m)=c\int\limits_{t_0}^\infty\dfrac{dt}{\sqrt{P(t)}}$ with $c\in\mathbb Q$?</strong><br> (EDIT: After Noam Elkies' remark, introduced $t_0$, the biggest real zero of $P$, instead of $0$ as the lower limit. Only "complete" integrals make sense here.)</li> </ul> <p>In particular for $d=-7$, we have by the <a href="http://en.wikipedia.org/wiki/Carlson_symmetric_form" rel="nofollow">Carlson symmetric form</a> $$\frac12\int\limits_0^\infty\dfrac{dt}{\sqrt{t(t+1)(t+\frac{8+3\sqrt 7}{16})}} =K(k_7)=\dfrac1{7^{1/4}4\pi}\Gamma\left(\dfrac17\right)\Gamma\left(\dfrac27\right)\Gamma\left(\dfrac47\right),$$ on the other hand I have seen somewhere (I can't remember the reference) $$\int\limits_0^\infty\dfrac{dt}{\sqrt{t(t^2+21t+112)}} =\dfrac1{4\pi\sqrt{7}}\Gamma\left(\dfrac17\right)\Gamma\left(\dfrac27\right)\Gamma\left(\dfrac47\right)=\frac{K(k_7)}{7^{1/4}}.$$ </p> <p>I would like to get it straight at least for this example: </p> <ul> <li><p><strong>Can the polynomial in the first integral be transformed into one with integer coefficients? And is there any sort of relationship between both above polynomials?</strong><br> Note that the ratio of the discriminants of the two above polynomials is $-2^{24}\cdot7^3$, and both of them do <em>not</em> yield affirmative answers, as the second one would have to be divided by $\sqrt7$ to obtain $K(k_7)$ directly!</p></li> <li><p><strong>EDIT: Follow-up question: If $P(t)$ is an integer cubic polynomial such that $\int\limits_{t_0}^\infty\dfrac{dt}{\sqrt{P(t)}}$ (with $t_0$ its biggest real zero) can be written in "finite terms", is this value always an algebraic multiple of an elliptic integral singular value $K(m)$?</strong></p></li> </ul> http://mathoverflow.net/questions/88233/how-many-consecutive-integers-x-can-make-ax2bxc-square how many consecutive integers $x$ can make $ax^2+bx+c$ square ? spanferkel 2012-02-11T22:17:47Z 2012-02-12T04:38:05Z <p>The following problem was raised in <a href="http://www.artofproblemsolving.com/Forum/viewtopic.php?f=56&amp;t=374534" rel="nofollow">a Mathlinks thread</a>: </p> <p><strong>If $a,b,c\in\mathbb Z$ such that $a\ne0$ and $b^2-4ac\ne 0$, for how many consecutive integers $x$ can $ax^2+bx+c$ ba a perfect square ?</strong> </p> <p>The polynomial $-15x^2+64$ is obviously a square for the five numbers $x=-2,...,2$, but the method used for finding this in the above thread cannot be extended further. <strong>Should $5$ really be the best possible answer?</strong></p> <p>Has this problem been treated somewhere else?</p> http://mathoverflow.net/questions/87704/is-there-any-expression-for-the-feigenbaum-constants Is there any expression for the Feigenbaum constants ? spanferkel 2012-02-06T19:06:08Z 2012-02-07T04:25:29Z <p>It has puzzled me for a long time that <strong>the Feigenbaum constant $\delta$ and reduction parameter $\alpha$ do not seem to be related to other constants</strong> (that is, numerically), even not to each other. In fact I have never seen them expressed as an integral, any kind of series or product, a nested expression, ... The only thing I have found on the internet is <a href="http://marvin.sn.schule.de/~inftreff/modul48/modul48.htm" rel="nofollow">this algorithmic approach</a> which further links to <a href="http://marvin.sn.schule.de/~inftreff/modul24/task24.htm" rel="nofollow">this</a>, but it seems rather like an "a posteriori" method, being interested more in the algorithm than in the nature of $\delta$. Anyway, I would <em>not</em> expect the prominent occurrence of the number $163$ in the algorithm to have a deeper meaning.</p> <p>On the other hand, I wouldn't be <em>too</em> surprised to see $\delta$ written as a continued fraction with "defineable" terms, given the fact that it can be defined by $\delta=\lim\limits_{n\to\infty}\dfrac{\mu_n-\mu_{n-1}}{\mu_{n+1}-\mu_n}$, where the $\mu_n$ are the bifurcation points of an iterated map. But I have never seen one either. Any leads?</p> http://mathoverflow.net/questions/44211/product-of-sine/87339#87339 Answer by spanferkel for Product of sine spanferkel 2012-02-02T16:13:35Z 2012-02-02T16:27:10Z <p>I couldn't resist... A different construction, which is "irreducible" also for odd $n$ unlike the construction of Ace of Base, is already implied by the very first example the OP gives. (Did you find it by computer and didn't notice?) Look at the differences of the numerators... It can be straight away generalized to $$\boxed{\sin\left(\dfrac{\pi}{2^{n+1}+2} \right)\prod\limits_{k=1}^{n-1}\sin\left(\dfrac{2^n+2^k+1}{2^{n+1}+2}\pi \right)=\dfrac1{2^n}}.$$ Sure enough, denoting $\sin\left(\dfrac{k\pi}{2^{n+1}+2}\right)$ and $\cos\left(\dfrac{k\pi}{2^{n+1}+2}\right)$ by $s_k$ and $c_k$ respectively, we have $$LHS=s_1\prod\limits_{k=1}^{n-1}c_{2^k}<br> =\frac1{2c_1}s_2\prod\limits_{k=1}^{n-1}c_{2^k} =\frac1{4c_1}s_4\prod\limits_{k=2}^{n-1}c_{2^k} =\cdots=\frac{s_{2^{n}}}{2^nc_1}=\frac1{2^n}.$$ </p> http://mathoverflow.net/questions/86988/integrating-gamma-products-and-quotients-over-a-vertical-line Integrating gamma products and quotients over a vertical line spanferkel 2012-01-29T21:21:44Z 2012-01-29T21:27:26Z <p>The <a href="http://functions.wolfram.com/GammaBetaErf/Gamma/21/01/01/" rel="nofollow">Wolfram functions collection</a> contains a small number of integrals of products and quotients of terms $\Gamma(a_i\pm t)$ over a vertical line, all of which can be evaluated in terms of only gamma functions. </p> <p><strong>Does somebody know references concerning formulae of this type?</strong> If they are obtained by the residue theorem, how?</p> <p>The second one seems to be false. By putting $2b=a-c+1$, we would get from it, after using the doubling formula, $$\int_{\gamma-i\infty}^{\gamma+i\infty}\Gamma(a+t)\Gamma(c-t)dt=2\pi i\cdot2^{a+c}{\Gamma(a+c)},$$ whereas for $a,c\in\mathbb Z$ such that $a+c\ge1$, we have $$\int\limits_{\gamma-i\infty}^{\gamma+i\infty}\Gamma(a+t)\Gamma(c-t)dt=\pi i\int\limits_{-\infty}^{\infty}\frac{\overbrace{(1-a-t)\cdots(c-1-t)}^{(a+c-1)\ {terms}}}{\cosh \pi t}dt=\pi i\int\limits_{-\infty}^{\infty}\frac{\Gamma(c-t)\; dt}{\Gamma(1-a-t)\cosh \pi t}$$ which may be written in umbral form as $(1-a-\frac E2)\cdots(c-1-\frac E2)$, i.e. as a linear combination of terms $\int\limits_{-\infty}^{\infty}\dfrac{t^{k}dt}{\cosh \pi t}=\dfrac{E_k}{2^k}$, where the $E_k$ are the (absolute) Euler numbers, thus it can definitely not be written in terms of $\Gamma(a+c)$ etc.</p> <p>Some others of the Wolfram identities <strong>look like they could be generalized</strong>, e.g. the first and third one. Is it true e.g. that for $n\ge3$, $$\int_{\gamma-i\infty}^{\gamma+i\infty}\prod\limits_{j=1}^n\Bigl(\Gamma(a_j+t)\Gamma(b_j-t)\Bigr)dt=2\pi i\frac{\prod_j\prod_k\Gamma(a_j+b_k)}{\Gamma(\sum a_j+\sum b_j)^{n-1}}$$ where all products and sums run from $1$ to $n$? (Note that again, this does not hold for $n=1$.)</p> http://mathoverflow.net/questions/86401/cubic-polynomials-with-nice-roots-which-can-be-expressed-by-trig-functions-of Cubic polynomials with "nice" roots, which can be expressed by trig functions of rational angles spanferkel 2012-01-22T21:04:07Z 2012-01-23T01:11:25Z <p>Consider the cubic polynomial $x^3-ax+b$ for $a,b\in\mathbb N$. </p> <p>It has three real roots which, by Cardano's formula, can of course be written in closed form using thirds of angles or cube roots of complex numbers.</p> <p>Now, in some cases, there is a much nicer way (at least in my opinion, how objective can this be??) of writing the roots: as a <strong>rational expression of trig functions of rational angles</strong>. Let's call such a polynomial <strong>nice</strong> in honour of Mathlinks, where this kind of roots are traditionally referred to as "nice roots", presumably starting with <a href="http://www.artofproblemsolving.com/Forum/viewtopic.php?f=38&amp;t=69475" rel="nofollow">this one</a>. </p> <p>For example, we can write</p> <ul> <li><p>the roots of $x^3-3x+1=0$ as $2\cos\dfrac{k\pi}9,\ k=2,4,8$,</p></li> <li><p>the roots of $x^3-21x+7=0$ as $\dfrac3{2\cos\frac{k\pi}7}+2,\ k=2,4,8$,</p></li> <li><p>the roots of $x^3-19x+19=0$ as $\dfrac7{2(\cos k\omega+\cos7k\omega+\cos49k\omega)}-2,$ where $\omega=\dfrac{\pi}{19}$ and $k=1,3,9$, or equivalently, </p></li> </ul> <p>$\dfrac{\sqrt{19}}{2(\sin k\omega+\sin 7k\omega+\sin 49k\omega)}$ or $\dfrac{2\sqrt{19}}{\csc k\omega+\csc 7k\omega+\csc 49k\omega}.$</p> <p>The last example (see also <a href="http://www.artofproblemsolving.com/Forum/viewtopic.php?f=38&amp;t=188014-" rel="nofollow">here</a>) shows that it makes sense to also admit square roots. (Probably that doesn't change anything, by virtue of <a href="http://www.artofproblemsolving.com/Forum/viewtopic.php?f=38&amp;t=190479" rel="nofollow">identities</a> of type $\tan\frac{{3\pi }}{{11}}+4\sin\frac{{2\pi }}{{11}}=\sqrt{11}$, but it can obviously allow to write roots in a more elegant way.)</p> <h2>Question:</h2> <p><em><strong>Is it possible to characterize the pairs $(a,b)$ that yield nice polynomials?</em></strong></p> <h2>Some ideas</h2> <ul> <li>For any angle $\frac{k\pi} n$ involved in a nice root, $\mathbb Z_3$ must be a subgroup of the multiplicative group $\mathbb Z_n^*$.</li> <li>For a nice polynomial $x^3-ax+b$, its discriminant $\Delta=4a^3-27b^2$ is always a square. (See theorem 2 <a href="http://planetmath.org/encyclopedia/GaloisGroupOfTheCubic.html" rel="nofollow">here</a>).</li> <li>It appears that if the involved fractions of $\pi$ have a common prime denominator, this prime divides both $a$ and $b$. (Why?)</li> <li>The article <a href="http://www.springerlink.com/content/lj477712r375r577/" rel="nofollow">Kurt Girstmair, On root polynomials of cyclic cubic equations, ARCHIV DER MATHEMATIK, Vol. 36, N° 1, 313-326, DOI: 10.1007/BF01223707</a> may possibly be helpful, but I can't access it.</li> <li>Maybe nice polynomials have something in common with the ones mentioned <a href="http://mathoverflow.net/questions/84864/cyclic-cubic-numbers-as-rational-linear-combinations-of-roots-of-unity" rel="nofollow">in this MO thread</a>, e.g. in the sense that in the definition of a nice cubic polynomial, if we replace "trig functions of rational angles" by "roots of unity", nothing essential changes?</li> </ul> http://mathoverflow.net/questions/86243/convex-polytopes-with-many-faces-and-edges-but-few-cells-and-vertices convex polytopes with many faces and edges but few cells and vertices spanferkel 2012-01-20T18:32:40Z 2012-01-20T19:53:02Z <p>For a convex polytope $P$ in $\mathbb R^4$, denote by $N_0,N_1,N_2,N_3$ respectively the number of vertices, edges, faces, cells. By Euler's formula, we know $N_0+N_2=N_1+N_3$, which means there is a sort of equilibrum among the $N_i$. But I wonder if there exist upper and/or lower bounds for $f(P):=\frac{N_1+N_2}{N_0+N_3}$ where $P\subset\mathbb R^4$ is any convex polytope.</p> <p>E.g. for the regular one called 24-cell, we have $f(P)=4$.</p> http://mathoverflow.net/questions/86042/how-many-vertices-edges-faces-at-most-for-a-convex-polyhedron-that-tiles-space How many vertices/edges/faces at most for a convex polyhedron that tiles space? spanferkel 2012-01-18T22:38:06Z 2012-01-19T01:10:09Z <p>I wonder if this problem has already been examined before: </p> <p>Consider a convex polyhedron that tiles $\mathbb R^3$. What is the maximum of vertices/edges/faces that such a polyhedron can have?</p> <p>Intuitively, it seems that the truncated octahedron is best possible for edges (36) as well as for vertices (24) Its packing is also known as <a href="http://en.wikipedia.org/wiki/Bitruncated_cubic_honeycomb" rel="nofollow">"bitruncated cubic honeycomb"</a>.</p> <p>For faces, we can do better than 14, as there is a polyhedron with 16 faces that can be obtained as follows: Take a truncated tetrahedron and add on each triangular face a small pyramid that is a quarter of a tetrahedron. The tessellation of it is known as the <a href="http://en.wikipedia.org/wiki/Quarter_cubic_honeycomb" rel="nofollow">quarter cubic honeycomb</a>, with each small tetrahedron "distributed" among its four neighbors.</p> <p><strong>Questions: Are these best possible? What about the corresponding problem in higher dimensions?</strong> </p> <p>In $\mathbb R^4$, it looks like the polytope yielded by the equivalent of the "Quarter cubic honeycomb" tiles it. This one, based on the <a href="http://en.wikipedia.org/wiki/Truncated_5-cell" rel="nofollow">truncated 5-cell</a> has 25 cells, 60 faces, 60 edges, and 25 vertices, and so for cells and vertices, it does again (slightly) better than the 24-cell with its 96 faces, 96 edges, and 24 vertices.</p> http://mathoverflow.net/questions/85678/eulers-divergent-series-sum-n-1n-what-is-known-about-the-resulting-constan Euler's divergent series sum n!*(-1)^n: what is known about the resulting constant? spanferkel 2012-01-14T18:13:34Z 2012-01-14T20:58:45Z <p>Much of the theory of continued fractions has been developped by Euler in the 18th century. The little survey <a href="http://www.oswego.edu/Documents/mathematics/EulerDivSeriescfProceedings.pdf" rel="nofollow">"Euler: continued fractions and divergent series (and Nicholas Bernoulli)"</a>, mentions towards the end the continued fraction $$f(x)=\dfrac{1}{1+\dfrac{x}{1+\dfrac{x}{1+\dfrac{2x}{1+\dfrac{2x}{1+\dfrac{3x}{1+\dots}}}}}}$$ which Euler has "derived" from the divergent power series $1-x+2x^2-6x^3+24x^4-+...$ . </p> <p>For $x=1$, the continued fraction converges to a limit $f(1)\approx 0.5963475922$. I was wondering: what is known about the values $f(x)$, in particular $f(1)$? Are they known to be transcendental for $x\in\mathbb N$? Can they be expressed by other known constants?</p> http://mathoverflow.net/questions/85132/rearrangement-style-inequality-with-lots-of-terms-and-little-evidence/85590#85590 Answer by spanferkel for Rearrangement-style inequality with lots of terms and little evidence spanferkel 2012-01-13T16:00:23Z 2012-01-14T11:03:16Z <p><strong>Edit: the following is false. (see my comment below)</strong> The Sum-maximum conjecture is easily proved by Fedja's observation. Put $S_a:=\frac1n\sum a_k$ and for big $N$, define $a_k^':=1+\frac{a_k-S_a}N$, similarly for $S_b$ and $b_k^'$. According to Fedja, the Product-sum conjecture holds for $a_k^'$ and $b_k^'$, and this implies the Sum-maximum conjecture for $a_k^'$ and $b_k^'$. Now we can replace $a_k^'$ and $b_k^'$ by $a_k$ and $b_k$ because the linear transformations don't change anything for the difference of the two sums.</p> <p>Too bad we can't say the same for the Product-sum conjecture as well.</p> http://mathoverflow.net/questions/92119/duality-of-eta-product-identities-a-new-idea/92133#92133 Comment by 2012-03-25T21:31:39Z 2012-03-25T21:31:39Z I suppose that's about the question of unique duals? It's not that simple. Even once we have established that a dual always exists, a simple &quot;infinite descend&quot; argument may not necessarily work. See my edit above. http://mathoverflow.net/questions/90904/any-relationship-between-viswanaths-constant-and-the-khinchine-levy-constant/91091#91091 Comment by 2012-03-13T21:27:13Z 2012-03-13T21:27:13Z Thank you for sharing these rather deep insights! http://mathoverflow.net/questions/90753/a-limit-by-gosper-involving-a-product-of-arctan-and-41-pi Comment by 2012-03-09T20:43:25Z 2012-03-09T20:43:25Z yes, this was intended. http://mathoverflow.net/questions/89996/why-are-some-q-analogues-more-canonical-than-others Comment by 2012-03-02T08:41:28Z 2012-03-02T08:41:28Z @Johann: and you don't think it is worth giving a special consideration to those &quot;doubly nice ones&quot; where both properties coincide? http://mathoverflow.net/questions/89413/convexity-of-jacobis-theta-function-with-zero-argument Comment by 2012-02-25T23:34:27Z 2012-02-25T23:34:27Z For the partial products, it even seems like the polynomials $$\frac{(-1)^N}{(q-1)^{3N-2}}\frac{d^2}{dq^2}\prod_{n=1}^N (1-q^{2n-1})^2(1-q^{2n})$$ have positive and unimodal coefficients. See e.g. tinyurl.com/WolframForNEq8 :) http://mathoverflow.net/questions/89238/arrangement-of-integers-1-k2-in-kk-grid-to-minimize-energy-function/89383#89383 Comment by 2012-02-24T17:42:56Z 2012-02-24T17:42:56Z For the torus, the filling in by rows also yields the same average $\frac{k^2-1}k$ as, for $k=2^n$, the Morton layout! http://mathoverflow.net/questions/89238/arrangement-of-integers-1-k2-in-kk-grid-to-minimize-energy-function Comment by 2012-02-23T18:54:38Z 2012-02-23T18:54:38Z Note that for $k=2^n$, the &quot;filling in row by row&quot; yields exactly the same average difference as for the Morton layout, viz. $(k+1)/2$. (assuming you mean horizontal and vertical neighbors only). So after all, I'd think there is no better arrangement than &quot;filling in row by row&quot; for the non-torus case. http://mathoverflow.net/questions/87551/can-elliptic-integral-singular-values-generate-cubic-polynomials-with-integer-coe/88874#88874 Comment by 2012-02-19T21:16:11Z 2012-02-19T21:16:11Z This is really cool. Thanks again! http://mathoverflow.net/questions/87551/can-elliptic-integral-singular-values-generate-cubic-polynomials-with-integer-coe Comment by 2012-02-05T13:16:11Z 2012-02-05T13:16:11Z Thank you very much. I have edited the lower limit, as it is exactly examples like yours I'm interested in. I suppose the curve is uniquely determined by $d$, up to translation? So again the question: What about $n=-7$? http://mathoverflow.net/questions/87551/can-elliptic-integral-singular-values-generate-cubic-polynomials-with-integer-coe Comment by 2012-02-05T00:03:33Z 2012-02-05T00:03:33Z I didn't necessarily think of that restriction. So if we restrict them to that, which polynomial(s) would that be for the $d=-7$ case? And how to find them? Unique? http://mathoverflow.net/questions/87061/a-pairing-problem-mb-related-to-wick-theorem Comment by 2012-01-31T20:37:41Z 2012-01-31T20:37:41Z No, that would be the complement of $3K_{2n}$. http://mathoverflow.net/questions/87061/a-pairing-problem-mb-related-to-wick-theorem Comment by 2012-01-31T19:15:35Z 2012-01-31T19:15:35Z @Ira: But the trivalent graphs may have multiple edges (but no loops). And even counting those wouldn't help to solve the problem I think. If I get it right, the problem asks for the number of 1-factors of the complement of $2nK_3$. http://mathoverflow.net/questions/86988/integrating-gamma-products-and-quotients-over-a-vertical-line Comment by 2012-01-30T22:54:36Z 2012-01-30T22:54:36Z Thank you very much. http://mathoverflow.net/questions/86864/when-can-a-family-of-polynomials-get-a-weight-function-to-be-made-orthogonal/86867#86867 Comment by 2012-01-28T10:24:36Z 2012-01-28T10:24:36Z Thank you. That's about what I expected: that one of the necessary conditions is essentially sufficient. Like Noam D. Elkies, I didn't really expect there to be any hope of deriving anything directly from a generating function. Let alone the even more hopeless question: If only $g(t,z)$ is given, is there even a way to know, <i>without</i> doing a Taylor expansion, that the coefficients will actually be polynomials in $z$? http://mathoverflow.net/questions/86573/minimal-polynomials-of-trig-functions-of-k-pi-p-and-divisibility-of-coeffici/86585#86585 Comment by 2012-01-25T18:34:21Z 2012-01-25T18:34:21Z I have just edited the expression for $x$ to make it (slightly) more general in a quite obvious way, and I think what you suggest should still apply. Only I don't really understand what you presume, particularly what do you mean by &quot;early terms of the expansion&quot;?