MathOverflow is a question and answer site for professional mathematicians. It's 100% free, no registration required.

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

As part of my Phd thesis on aperiodic Wang tilings, I've discovered I need a bound on the irrationality measure of $\gamma = \log 2/\log 6$. That is, I am looking for an upper bound on the quantity

$\eta = \inf \{\alpha : \left|\frac{\log 2}{\log 6} - \frac{p}{q}\right| < \frac{1}{q^\alpha} \text{ for only finitely many $p,q\in\mathbf Z$}\}$.

I have found a paper An explicit lower bound for a homogeneous rational linear form in logarithms of algebraic numbers by E.M. Matveev. This paper gives a complicated system of parameters which can be adjusted bound the irrationality measure of rational linear combinations of logs. From this I have managed to obtain the bound

$\eta < 10^9$.

Does anyone know of references that can produce a better bound on this quanity? Perhaps one closer to its likely value of 2?

share|cite|improve this question
up vote 26 down vote accepted

See Georges Rhin: Approximations de Padé et mesures effectives d'irrationalité. (French) [Padé approximants and effective measures of irrationality] Séminaire de Théorie des Nombres, Paris 1985–86, 155–164, Progr. Math., 71, Birkhäuser Boston, Boston, MA, 1987.

Inequality (8) there shows that if $u_0$, $u_1$ and $u_2$ are integers with $H= \max(|u_1|,|u_2|)$ sufficiently large, then we have $$ |u_0+u_1\log 2 + u_2 \log 3| \ge H^{-7.616}. $$ Thus $\eta \le 8.616$.

I don't know a free online version for Rhin's paper (you can find it on Springer Link). But you can look at this paper by Qiang Wu in Math. Comp. which discusses similar problems and mentions Rhin's work (which seems the best known result for the $\log 2$ and $\log 3$ case).

share|cite|improve this answer
This is great. I've contacted Rhin about his paper. Thank you. – Jason Siefken May 15 '14 at 0:22

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

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