Powered by OpenAIRE graph
Found an issue? Give us feedback
image/svg+xml art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos Open Access logo, converted into svg, designed by PLoS. This version with transparent background. http://commons.wikimedia.org/wiki/File:Open_Access_logo_PLoS_white.svg art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos http://www.plos.org/ Mathematics of Compu...arrow_drop_down
image/svg+xml art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos Open Access logo, converted into svg, designed by PLoS. This version with transparent background. http://commons.wikimedia.org/wiki/File:Open_Access_logo_PLoS_white.svg art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos http://www.plos.org/
Mathematics of Computation
Article
License: publisher-specific, author manuscript
Data sources: UnpayWall
image/svg+xml art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos Open Access logo, converted into svg, designed by PLoS. This version with transparent background. http://commons.wikimedia.org/wiki/File:Open_Access_logo_PLoS_white.svg art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos http://www.plos.org/
Research.fi
Article . 2020 . Peer-reviewed
Data sources: Research.fi
image/svg+xml Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao Closed Access logo, derived from PLoS Open Access logo. This version with transparent background. http://commons.wikimedia.org/wiki/File:Closed_Access_logo_transparent.svg Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao
image/svg+xml Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao Closed Access logo, derived from PLoS Open Access logo. This version with transparent background. http://commons.wikimedia.org/wiki/File:Closed_Access_logo_transparent.svg Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao
image/svg+xml Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao Closed Access logo, derived from PLoS Open Access logo. This version with transparent background. http://commons.wikimedia.org/wiki/File:Closed_Access_logo_transparent.svg Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao
zbMATH Open
Article . 2016
Data sources: zbMATH Open
versions View all 4 versions
addClaim

This Research product is the result of merged Research products in OpenAIRE.

You have already added 0 works in your ORCID record related to the merged Research product.

Explicit lower bounds for linear forms

Authors: Leppälä Kalle;

Explicit lower bounds for linear forms

Abstract

Let I \mathbb {I} be the field of rational numbers or an imaginary quadratic field and Z I \mathbb {Z}_\mathbb {I} its ring of integers. We study some general lemmas that produce lower bounds \[ | B 0 + B 1 θ 1 + ⋯ + B r θ r | ≥ 1 max { | B 1 | , … , | B r | } μ \lvert B_0+B_1\theta _1+\cdots +B_r\theta _r\rvert \ge \frac {1}{\max \{\lvert B_1 \rvert ,\ldots ,\lvert B_r \rvert \}^\mu } \] for all B 0 , … , B r ∈ Z I B_0,\ldots ,B_r \in \mathbb {Z}_{\mathbb {I}} , max { | B 1 | , … , | B r | } ≥ H 0 \max \{\lvert B_1 \rvert ,\ldots ,\lvert B_r \rvert \} \ge H_0 , given suitable simultaneous approximating sequences of the numbers θ 1 , … , θ r \theta _1,\ldots ,\theta _r . We manage to replace the lower bound with 1 / max { | B 1 | μ 1 , … , | B r | μ r } 1/{\max \{\lvert B_1 \rvert ^{\mu _1},\ldots ,\lvert B_r \rvert ^{\mu _r}\}} for all B 0 , … , B r ∈ Z I B_0,\ldots ,B_r \in \mathbb {Z}_{\mathbb {I}} , max { | B 1 | μ 1 , … , | B r | μ r } ≥ H 0 \max \{\lvert B_1 \rvert ^{\mu _1},\ldots ,\lvert B_r \rvert ^{\mu _r}\} \ge H_0 , where the exponents μ 1 , … , μ r \mu _1,\ldots ,\mu _r are different when the given type II approximating sequences approximate some of the numbers θ 1 , … , θ r \theta _1,\ldots ,\theta _r better than the others. As an application we research certain linear forms in logarithms. Our results are completely explicit.

Related Organizations
Keywords

NUMBERS, Diophantine inequalities, PI, linear forms, explicit lower bounds, Measures of irrationality and of transcendence, IRRATIONALITY MEASURE, LOGARITHMS

  • BIP!
    Impact byBIP!
    selected citations
    These citations are derived from selected sources.
    This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
    0
    popularity
    This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.
    Average
    influence
    This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
    Average
    impulse
    This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.
    Average
Powered by OpenAIRE graph
Found an issue? Give us feedback
selected citations
These citations are derived from selected sources.
This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
BIP!Citations provided by BIP!
popularity
This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.
BIP!Popularity provided by BIP!
influence
This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
BIP!Influence provided by BIP!
impulse
This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.
BIP!Impulse provided by BIP!
0
Average
Average
Average
hybrid
Related to Research communities