Effective results on the Skolem problem for linear recurrence sequences (Q1634425): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / arXiv ID
 
Property / arXiv ID: 1505.07147 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deux propriétés décidables des suites récurrentes linéaires / rank
 
Normal rank
Property / cites work
 
Property / cites work: The presence of a zero in an integer linear recurrent sequence is NP-hard to decide / rank
 
Normal rank
Property / cites work
 
Property / cites work: Absolute Real Root Separation / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Complexity of the Orbit Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Counting degenerate polynomials of fixed degree and bounded height / rank
 
Normal rank
Property / cites work
 
Property / cites work: Counting and Testing Dominant Polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Positive density of integer polynomials with some prescribed properties / rank
 
Normal rank
Property / cites work
 
Property / cites work: Explicit Form of Cassels’<i>p</i>-adic Embedding Theorem for Number Fields / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4421931 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Vandermonde Matrix / rank
 
Normal rank
Property / cites work
 
Property / cites work: An inequality for the discriminant of a polynomial / rank
 
Normal rank
Property / cites work
 
Property / cites work: An explicit lower bound for a homogeneous rational linear form in the logarithms of algebraic numbers. II / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5188094 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4248251 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3671245 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decision Problems for Linear Recurrence Sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3545513 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Occurrence of zero in a linear recursive sequence / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4488162 / rank
 
Normal rank

Latest revision as of 17:33, 17 July 2024

scientific article
Language Label Description Also known as
English
Effective results on the Skolem problem for linear recurrence sequences
scientific article

    Statements

    Effective results on the Skolem problem for linear recurrence sequences (English)
    0 references
    0 references
    18 December 2018
    0 references
    Let \(\{u_n\}\) be a simple linear recurrence sequence of algebraic numbers defined by of order \(m \geq 2\) with characteristic polynomial \[f(X)=X^m-a_{m-1}X^{m-1}-\dots-a_0\] with algebraic coefficients. Suppose that \(f(X)\) has a dominant root. Let \(d\) be the degree of the normal closure of \({\mathbb Q}(a_0,\dots,a_{m-1})\) over \({\mathbb Q}\), and \(f^*(X)=\delta_f f(X)=\sum_{k=0}^m a_i^* X^i\) be the polynomial with the smallest positive integer \(\delta_f\) for which all \(a_i^*\) are algebraic integers. The author gives an explicit bound \(B\) in terms of \(d,m, h(a_i^*)\) and \(D=[{\mathbb Q}(u_0,\dots,u_{m-1}):{\mathbb Q}]\) for which one can claim that \(u_n \ne 0\) whenever \(n \geq B\). A similar bound is obtained in the case when \(f\) has exactly two roots of maximal modulus, and moreover their quotient is not a root of unity.
    0 references
    linear recurrence sequence
    0 references
    Skolem problem
    0 references
    height
    0 references
    linear form in logarithms
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references