On Baker type lower bounds for linear forms

Tapani Matala-aho

Displaying similar documents to “On Baker type lower bounds for linear forms”

Hybrid sup-norm bounds for Hecke–Maass cusp forms

Nicolas Templier (2015)

Journal of the European Mathematical Society

Similarity:

Let $f$ be a Hecke–Maass cusp form of eigenvalue $λ$ and square-free level $N$ . Normalize the hyperbolic measure such that $vol (Y_{0} (N)) = 1$ and the form $f$ such that ${∥ f ∥}_{2} = 1$ . It is shown that ${∥ f ∥}_{\infty} ≪_{ϵ} λ^{\frac{5}{24} + ϵ} N^{\frac{1}{3} + ϵ}$ for all $ϵ > 0$ . This generalizes simultaneously the current best bounds in the eigenvalue and level aspects.

The Diophantine Equation X³ = u+v over Real Quadratic Fields

Takaaki Kagawa (2011)

Bulletin of the Polish Academy of Sciences. Mathematics

Similarity:

Let k be a real quadratic field and let $_{k}$ and $_{k}^{\times}$ be the ring of integers and the group of units, respectively. A method of solving the Diophantine equation X³ = u+v ( $X \in_{k}$ , $u, v \in_{k}^{\times}$ ) is developed.

Explicit lower bounds for ${| | (3 / 2)}^{k} | |$

Laurent Habsieger (2003)

Acta Arithmetica

Similarity:

On the diophantine equation $x^{y} - y^{x} = c^{z}$

Zhongfeng Zhang, Jiagui Luo, Pingzhi Yuan (2012)

Colloquium Mathematicae

Similarity:

Applying results on linear forms in p-adic logarithms, we prove that if (x,y,z) is a positive integer solution to the equation $x^{y} - y^{x} = c^{z}$ with gcd(x,y) = 1 then (x,y,z) = (2,1,k), (3,2,k), k ≥ 1 if c = 1, and either $(x, y, z) = (c^{k} + 1, 1, k)$ , k ≥ 1 or $2 \leq x < y \leq m a x 1.5 \times 10^{10}, c$ if c ≥ 2.

Diophantine equations and class number of imaginary quadratic fields

Zhenfu Cao, Xiaolei Dong (2000)

Discussiones Mathematicae - General Algebra and Applications

Similarity:

Let A, D, K, k ∈ ℕ with D square free and 2 ∤ k,B = 1,2 or 4 and $μ_{i} \in - 1, 1 (i = 1, 2)$ , and let $h (- 2^{1 - e} D) (e = 0 o r 1)$ denote the class number of the imaginary quadratic field $ℚ (\sqrt (- 2^{1 - e} D))$ . In this paper, we give the all-positive integer solutions of the Diophantine equation Ax² + μ₁B = K((Ay² + μ₂B)/K)ⁿ, 2 ∤ n, n > 1 and we prove that if D > 1, then $h (- 2^{1 - e} D) \equiv 0 (m o d n)$ , where D, and n satisfy $k ⁿ - 2^{e + 1} = D x ²$ , x ∈ ℕ, 2 ∤ n, n > 1. The results are valuable for the realization of quadratic field cryptosystem.

Inhomogeneous Diophantine approximation with general error functions

Lingmin Liao, Michał Rams (2013)

Acta Arithmetica

Similarity:

Let α be an irrational and φ: ℕ → ℝ⁺ be a function decreasing to zero. Let $ω (α) : = s u p θ \geq 1 : l i m i n f_{n \to \infty} n^{θ} | | n α | = 0$ $. F o r a n y α w i t h a g i v e n ω (α), w e g i v e s o m e s h a r p e s t i m a t e s f o r t h e H a u s d o r f f d i m e n s i o n o f t h e s e t$ $E_{φ} (α)$ := y ∈ ℝ: ||nα -y|| < φ(n) for infinitely many n, where ||·|| denotes the distance to the nearest integer.

Finiteness results for Diophantine triples with repdigit values

Attila Bérczes, Florian Luca, István Pink, Volker Ziegler (2016)

Acta Arithmetica

Similarity:

Let g ≥ 2 be an integer and $_{g} \subset ℕ$ be the set of repdigits in base g. Let $_{g}$ be the set of Diophantine triples with values in $_{g}$ ; that is, $_{g}$ is the set of all triples (a,b,c) ∈ ℕ³ with c < b < a such that ab + 1, ac + 1 and bc + 1 lie in the set $_{g}$ . We prove effective finiteness results for the set $_{g}$ .

On some Diophantine equations involving balancing numbers

Euloge Tchammou, Alain Togbé (2021)

Archivum Mathematicum

Similarity:

In this paper, we find all the solutions of the Diophantine equation $B_{1}^{p} + 2 B_{2}^{p} + \dots + k B_{k}^{p} = B_{n}^{q}$ in positive integer variables $(k, n)$ , where $B_{i}$ is the $i^{t h}$ balancing number if the exponents $p$ , $q$ are included in the set ${1, 2}$ .

Diophantine equations involving factorials

Horst Alzer, Florian Luca (2017)

Mathematica Bohemica

Similarity:

We study the Diophantine equations ${(k!)}^{n} - k^{n} = {(n!)}^{k} - n^{k}$ and ${(k!)}^{n} + k^{n} = {(n!)}^{k} + n^{k},$ where $k$ and $n$ are positive integers. We show that the first one holds if and only if $k = n$ or $(k, n) = (1, 2), (2, 1)$ and that the second one holds if and only if $k = n$ .

On systems of diophantine equations with a large number of solutions

Jerzy Browkin (2010)

Colloquium Mathematicae

Similarity:

We consider systems of equations of the form $x_{i} + x_{j} = x_{k}$ and $x_{i} \cdot x_{j} = x_{k}$ , which have finitely many integer solutions, proposed by A. Tyszka. For such a system we construct a slightly larger one with much more solutions than the given one.

A note on the article by F. Luca “On the system of Diophantine equations $a ² + b ² = {(m ² + 1)}^{r}$ and $a^{x} + b^{y} = {(m ² + 1)}^{z}$ ” (Acta Arith. 153 (2012), 373-392)

Takafumi Miyazaki (2014)

Acta Arithmetica

Similarity:

Let r,m be positive integers with r > 1, m even, and A,B be integers satisfying $A + B \sqrt (- 1) = {(m + \sqrt (- 1))}^{r}$ . We prove that the Diophantine equation ${| A |}^{x} + {| B |}^{y} = {(m ² + 1)}^{z}$ has no positive integer solutions in (x,y,z) other than (x,y,z) = (2,2,r), whenever $r > 10^{74}$ or $m > 10^{34}$ . Our result is an explicit refinement of a theorem due to F. Luca.

Diophantine approximations with Fibonacci numbers

Victoria Zhuravleva (2013)

Journal de Théorie des Nombres de Bordeaux

Similarity:

Let $F_{n}$ be the $n$ -th Fibonacci number. Put $ϕ = \frac{1 + \sqrt{5}}{2}$ . We prove that the following inequalities hold for any real $α$ : 1) ${inf}_{n \in ℕ} | | F_{n} α | | \leq \frac{ϕ - 1}{ϕ + 2}$ , 2) ${lim inf}_{n \to \infty} | | F_{n} α | | \leq \frac{1}{5}$ , 3) ${lim inf}_{n \to \infty} | | ϕ^{n} α | | \leq \frac{1}{5}$ . These results are the best possible.

Diophantine triples with values in binary recurrences

Clemens Fuchs, Florian Luca, Laszlo Szalay (2008)

Annali della Scuola Normale Superiore di Pisa - Classe di Scienze

Similarity:

In this paper, we study triples $a, b$ and $c$ of distinct positive integers such that $a b + 1, a c + 1$ and $b c + 1$ are all three members of the same binary recurrence sequence.

Solutions of the Diophantine Equation $7 X^{2} + Y^{7} = Z^{2}$ from Recurrence Sequences

Hayder R. Hashim (2020)

Communications in Mathematics

Similarity:

Consider the system $x^{2} - a y^{2} = b$ , $P (x, y) = z^{2}$ , where $P$ is a given integer polynomial. Historically, the integer solutions of such systems have been investigated by many authors using the congruence arguments and the quadratic reciprocity. In this paper, we use Kedlaya’s procedure and the techniques of using congruence arguments with the quadratic reciprocity to investigate the solutions of the Diophantine equation $7 X^{2} + Y^{7} = Z^{2}$ if $(X, Y) = (L_{n}, F_{n})$ (or $(X, Y) = (F_{n}, L_{n})$ ) where ${F_{n}}$ and ${L_{n}}$ represent the sequences of Fibonacci numbers and Lucas numbers...

Around the Littlewood conjecture in Diophantine approximation

Yann Bugeaud (2014)

Publications mathématiques de Besançon

Similarity:

The Littlewood conjecture in Diophantine approximation claims that $inf_{q \geq 1} q \cdot ∥ q α ∥ \cdot ∥ q β ∥ = 0$ holds for all real numbers $α$ and $β$ , where $∥ \cdot ∥$ denotes the distance to the nearest integer. Its $p$ -adic analogue, formulated by de Mathan and Teulié in 2004, asserts that $inf_{q \geq 1} q \cdot ∥ q α ∥ \cdot {| q |}_{p} = 0$ holds for every real number $α$ and every prime number $p$ , where ${| \cdot |}_{p}$ denotes the $p$ -adic absolute value normalized by ${| p |}_{p} = p^{- 1}$ . We survey the known results on these conjectures and highlight recent developments. ...

Multiplicative relations on binary recurrences

Florian Luca, Volker Ziegler (2013)

Acta Arithmetica

Similarity:

Given a binary recurrence ${u_{n}}_{n \geq 0}$ , we consider the Diophantine equation $u_{n_{1}}^{x_{1}} \dots u_{n_{L}}^{x_{L}} = 1$ with nonnegative integer unknowns $n_{1}, . . ., n_{L}$ , where $n_{i} \neq n_{j}$ for 1 ≤ i < j ≤ L, $m a x | x_{i} | : 1 \leq i \leq L \leq K$ , and K is a fixed parameter. We show that the above equation has only finitely many solutions and the largest one can be explicitly bounded. We demonstrate the strength of our method by completely solving a particular Diophantine equation of the above form.

Minimal $𝒮$ -universality criteria may vary in size

Noam D. Elkies, Daniel M. Kane, Scott Duke Kominers (2013)

Journal de Théorie des Nombres de Bordeaux

Similarity:

In this note, we give simple examples of sets $𝒮$ of quadratic forms that have minimal $𝒮$ -universality criteria of multiple cardinalities. This answers a question of Kim, Kim, and Oh [KKO05] in the negative.