---
res:
  bibo_abstract:
  - "We explore two questions about pseudo-polynomials, which\r\nare functions f :
    N → Z such that k divides f(n + k) −\r\nf(n) for all n, k. First, for certain
    arbitrarily sparse sets R, we\r\nconstruct pseudo-polynomials f with p|f(n) for
    some n only if\r\np ∈ R. This implies that not all pseudo-polynomials satisfy
    an\r\nassumption of a recent paper of Kowalski and Soundararajan.\r\nWe also consider
    α-primary pseudo-polynomials, where the\r\npseudo-polynomial condition is only
    required for k lying in\r\na set of primes of density α. We show that if an α-primary\r\npseudo-polynomial
    is O(e(β−)n), where β = √7\r\n3 − 1\r\n6 ≈ 0.715,\r\nthen it is a polynomial.@eng"
  bibo_authorlist:
  - foaf_Person:
      foaf_givenName: Vivian Zieve
      foaf_name: Kuperberg, Vivian Zieve
      foaf_surname: Kuperberg
      foaf_workInfoHomepage: http://www.librecat.org/personId=c3bac823-112d-11f0-a3f5-c264f852e697
  bibo_doi: 10.1016/j.jnt.2022.04.006
  bibo_volume: 241
  dct_date: 2022^xs_gYear
  dct_isPartOf:
  - http://id.crossref.org/issn/0022-314X
  dct_language: eng
  dct_publisher: Elsevier@
  dct_subject:
  - Pseudo-polynomials
  - Chinese remainder theorem
  - Ruzsa’s conjecture
  dct_title: On pseudo-polynomials divisible only by a sparse set of primes and α-primary
    pseudo-polynomials@
...