JSON-LD is the canonical representation for SciGraph data.

TIP: You can open this SciGraph record using an external JSON-LD service: JSON-LD Playground Google SDTT

[
  {
    "@context": "https://springernature.github.io/scigraph/jsonld/sgcontext.json", 
    "about": [
      {
        "id": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/08", 
        "inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/", 
        "name": "Information and Computing Sciences", 
        "type": "DefinedTerm"
      }, 
      {
        "id": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/0802", 
        "inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/", 
        "name": "Computation Theory and Mathematics", 
        "type": "DefinedTerm"
      }
    ], 
    "author": [
      {
        "affiliation": {
          "alternateName": "Institute of Mathematics, University of Tsukuba, 1-1-1 Tennodai, 350-0006, Tsukuba, Ibaraki, Japan", 
          "id": "http://www.grid.ac/institutes/grid.20515.33", 
          "name": [
            "Institute of Mathematics, University of Tsukuba, 1-1-1 Tennodai, 350-0006, Tsukuba, Ibaraki, Japan"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Akiyama", 
        "givenName": "Shigeki", 
        "id": "sg:person.011153327405.03", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.011153327405.03"
        ], 
        "type": "Person"
      }, 
      {
        "affiliation": {
          "alternateName": "Mathematical Institute, Leiden University, P.O. Box 9512, 2300, RA Leiden, The Netherlands", 
          "id": "http://www.grid.ac/institutes/grid.5132.5", 
          "name": [
            "Mathematical Institute, Leiden University, P.O. Box 9512, 2300, RA Leiden, The Netherlands"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Evertse", 
        "givenName": "Jan-Hendrik", 
        "id": "sg:person.015165732215.42", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.015165732215.42"
        ], 
        "type": "Person"
      }, 
      {
        "affiliation": {
          "alternateName": "Department of Computer Science, University of Debrecen, P.O. Box 12, H-4010, Debrecen, Hungary", 
          "id": "http://www.grid.ac/institutes/grid.7122.6", 
          "name": [
            "Department of Computer Science, University of Debrecen, P.O. Box 12, H-4010, Debrecen, Hungary"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Peth\u0151", 
        "givenName": "Attila", 
        "id": "sg:person.013334020373.46", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.013334020373.46"
        ], 
        "type": "Person"
      }
    ], 
    "datePublished": "2017-05-30", 
    "datePublishedReg": "2017-05-30", 
    "description": "A nearly linear recurrence sequence (nlrs) is a complex sequence (an) with the property that there exist complex numbers A0,\u2026, Ad\u22121 such that the sequence an+d+Ad\u22121an+d\u22121+\u22ef+A0ann=0\u221e\\documentclass[12pt]{minimal}\n\t\t\t\t\\usepackage{amsmath}\n\t\t\t\t\\usepackage{wasysym}\n\t\t\t\t\\usepackage{amsfonts}\n\t\t\t\t\\usepackage{amssymb}\n\t\t\t\t\\usepackage{amsbsy}\n\t\t\t\t\\usepackage{mathrsfs}\n\t\t\t\t\\usepackage{upgreek}\n\t\t\t\t\\setlength{\\oddsidemargin}{-69pt}\n\t\t\t\t\\begin{document}\n$$\\big(a_{n+d} + A_{d-1}a_{n+d-1} + \\cdots + A_{0}a_{n}\\big)_{n=0}^{\\infty }$$\n\\end{document} is bounded. We give an asymptotic Binet-type formula for such sequences. We compare (an) with a natural linear recurrence sequence (lrs) (\u00e3n)\\documentclass[12pt]{minimal}\n\t\t\t\t\\usepackage{amsmath}\n\t\t\t\t\\usepackage{wasysym}\n\t\t\t\t\\usepackage{amsfonts}\n\t\t\t\t\\usepackage{amssymb}\n\t\t\t\t\\usepackage{amsbsy}\n\t\t\t\t\\usepackage{mathrsfs}\n\t\t\t\t\\usepackage{upgreek}\n\t\t\t\t\\setlength{\\oddsidemargin}{-69pt}\n\t\t\t\t\\begin{document}\n$$(\\tilde{a}_{n})$$\n\\end{document} associated with it and prove under certain assumptions that the difference sequence (an\u2212\u00e3n)\\documentclass[12pt]{minimal}\n\t\t\t\t\\usepackage{amsmath}\n\t\t\t\t\\usepackage{wasysym}\n\t\t\t\t\\usepackage{amsfonts}\n\t\t\t\t\\usepackage{amssymb}\n\t\t\t\t\\usepackage{amsbsy}\n\t\t\t\t\\usepackage{mathrsfs}\n\t\t\t\t\\usepackage{upgreek}\n\t\t\t\t\\setlength{\\oddsidemargin}{-69pt}\n\t\t\t\t\\begin{document}\n$$(a_{n} -\\tilde{ a}_{n})$$\n\\end{document} tends to infinity. We show that several finiteness results for lrs, in particular the Skolem-Mahler-Lech theorem and results on common terms of two lrs, are not valid anymore for nlrs with integer terms. Our main tool in these investigations is an observation that lrs with transcendental terms may have large fluctuations, quite different from lrs with algebraic terms. On the other hand, we show under certain hypotheses that though there may be infinitely many of them, the common terms of two nlrs are very sparse. The proof of this result combines our Binet-type formula with a Baker type estimate for logarithmic forms.", 
    "editor": [
      {
        "familyName": "Elsholtz", 
        "givenName": "Christian", 
        "type": "Person"
      }, 
      {
        "familyName": "Grabner", 
        "givenName": "Peter", 
        "type": "Person"
      }
    ], 
    "genre": "chapter", 
    "id": "sg:pub.10.1007/978-3-319-55357-3_1", 
    "inLanguage": "en", 
    "isAccessibleForFree": true, 
    "isPartOf": {
      "isbn": [
        "978-3-319-55356-6", 
        "978-3-319-55357-3"
      ], 
      "name": "Number Theory \u2013 Diophantine Problems, Uniform Distribution and Applications", 
      "type": "Book"
    }, 
    "keywords": [
      "linear recurrence sequences", 
      "recurrence sequences", 
      "Skolem\u2013Mahler", 
      "Lech theorem", 
      "algebraic terms", 
      "finiteness results", 
      "transcendental terms", 
      "integer terms", 
      "type estimates", 
      "difference sequence", 
      "main tool", 
      "certain assumptions", 
      "certain hypotheses", 
      "logarithmic form", 
      "large fluctuations", 
      "formula", 
      "such sequences", 
      "theorem", 
      "infinity", 
      "terms", 
      "fluctuations", 
      "proof", 
      "assumption", 
      "complex sequence", 
      "A0", 
      "estimates", 
      "results", 
      "common terms", 
      "properties", 
      "sequence", 
      "LR", 
      "tool", 
      "form", 
      "observations", 
      "investigation", 
      "hand", 
      "hypothesis", 
      "NLR"
    ], 
    "name": "On Nearly Linear Recurrence Sequences", 
    "pagination": "1-24", 
    "productId": [
      {
        "name": "dimensions_id", 
        "type": "PropertyValue", 
        "value": [
          "pub.1085706155"
        ]
      }, 
      {
        "name": "doi", 
        "type": "PropertyValue", 
        "value": [
          "10.1007/978-3-319-55357-3_1"
        ]
      }
    ], 
    "publisher": {
      "name": "Springer Nature", 
      "type": "Organisation"
    }, 
    "sameAs": [
      "https://doi.org/10.1007/978-3-319-55357-3_1", 
      "https://app.dimensions.ai/details/publication/pub.1085706155"
    ], 
    "sdDataset": "chapters", 
    "sdDatePublished": "2022-05-10T10:55", 
    "sdLicense": "https://scigraph.springernature.com/explorer/license/", 
    "sdPublisher": {
      "name": "Springer Nature - SN SciGraph project", 
      "type": "Organization"
    }, 
    "sdSource": "s3://com-springernature-scigraph/baseset/20220509/entities/gbq_results/chapter/chapter_68.jsonl", 
    "type": "Chapter", 
    "url": "https://doi.org/10.1007/978-3-319-55357-3_1"
  }
]

Download the RDF metadata as:  json-ld nt turtle xml License info

This table displays all metadata directly associated to this object as RDF triples.

123 TRIPLES      23 PREDICATES      63 URIs      56 LITERALS      7 BLANK NODES