---
res:
  bibo_abstract:
  - "We study sumsets \U0001D49C + ℬ in the set of squares \U0001D4AE (and, more generally,
    in the set of kth powers \U0001D4AEk, where k ≥2 is an integer). It is known by
    a result of Gyarmati that \U0001D49C + ℬ ⊂ \U0001D4AEk ∩[1,N] implies that min(|\U0001D49C|,|ℬ|)
    =Ok(logN). Here, we study how the upper bound on |ℬ| decreases, when the size
    of |\U0001D49C| increases (or vice versa). In particular, if |\U0001D49C| ≥ Ck1m
    m(logN)1m , then |ℬ| = Ok(m2logN), for sufficiently large N, a positive integer
    m and an explicit constant C > 0. For example, with m ∼ loglogN this gives: If
    |\U0001D49C| ≥ CkloglogN,then |ℬ| = Ok(logN(loglogN)2).@eng"
  bibo_authorlist:
  - foaf_Person:
      foaf_givenName: Christian
      foaf_name: Elsholtz, Christian
      foaf_surname: Elsholtz
  - foaf_Person:
      foaf_givenName: Lena
      foaf_name: Wurzinger, Lena
      foaf_surname: Wurzinger
      foaf_workInfoHomepage: http://www.librecat.org/personId=50c57d72-32a8-11ee-aeea-d652094d2ccd
    orcid: 0009-0004-5360-0074
  bibo_doi: 10.1093/qmath/haae044
  bibo_issue: '4'
  bibo_volume: 75
  dct_date: 2024^xs_gYear
  dct_identifier:
  - UT:001304396600001
  dct_isPartOf:
  - http://id.crossref.org/issn/0033-5606
  - http://id.crossref.org/issn/1464-3847
  dct_language: eng
  dct_publisher: Oxford University Press@
  dct_title: Sumsets in the set of squares@
...