◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

Forrest J. Francis

4 papers here

Matching runs newest-first, so older work may not be attached to this profile yet.

author position
  • sole author1
  • first author1
  • last author2

Across the 4 of 4 papers where every author was matched, so the position is known.

fields
  • math.NT4

identity via Semantic Scholar / OpenAlex

activity
20182020
most citedAn Investigation Into Several Explicit Versions of Burgess' Bound

2 citations · 3 across the 2 of their papers we have counts for

collaborators

4 papers

math.NT2020★ 1 cited

Explicit Improvements to the Burgess Bound Via Pólya-Vinogradov

Matteo Bordignon, Forrest Francis

We make explicit a theorem of Fromm and Goldmakher [arXiv:1706.03002], which states that one can improve Burgess' bound for short character sums simply by improving the leading con…

math.NT2020

Additive Representations of Natural Numbers

Forrest J. Francis, Ethan S. Lee

Every natural number greater than two may be written as the sum of a prime and a square-free number. We establish several generalisations of this, by placing divisibility condition…

math.NT2019★ 2 cited

An Investigation Into Several Explicit Versions of Burgess' Bound

Forrest J. Francis

Let χ be a Dirichlet character modulo p, a prime. In applications, one often needs estimates for short sums involving χ. One such estimate is the family of bounds known as \e…

math.NT2018

Euler's Function on Products of Primes in Progressions

Amir Akbary, Forrest J. Francis

We study generalizations of some results of Jean-Louis Nicolas regarding the relation between small values of Euler's function φ(n) and the Riemann Hypothesis. Among other things…

◍wovepaper

Papers, researchers and institutions, woven together.

Explore
  • Search
  • Researchers
  • Institutions
Account
  • Library
  • Chat
Data
  • arXiv.org
  • Semantic Scholar
  • OpenAlex
  • Latest RSS
AboutContactPrivacyDevelopersllms.txtopenapi.json
Not affiliated with arXiv. Researcher data from Semantic Scholar (ODC-BY) and OpenAlex.