skip to main content
US FlagAn official website of the United States government
dot gov icon
Official websites use .gov
A .gov website belongs to an official government organization in the United States.
https lock icon
Secure .gov websites use HTTPS
A lock ( lock ) or https:// means you've safely connected to the .gov website. Share sensitive information only on official, secure websites.

Explore Research Products in the PAR
It may take a few hours for recently added research products to appear in PAR search results.


  • Home
  • Search Results
  • Page 1 of 1

Search for: All records

Award ID contains: 1802224

Note: When clicking on a Digital Object Identifier (DOI) number, you will be taken to an external site maintained by the publisher. Some full text articles may not yet be available without a charge during the embargo (administrative interval).
What is a DOI Number?

Some links on this page may take you to non-federal websites. Their policies may differ from this site.

  1. ; ; ; ; (, The Quarterly Journal of Mathematics)
    Abstract Singmaster’s conjecture asserts that every natural number greater than one occurs at most a bounded number of times in Pascal’s triangle; that is, for any natural number $$t \geq 2$$, the number of solutions to the equation $$\binom{n}{m} = t$$ for natural numbers $$1 \leq m \lt n$$ is bounded. In this paper we establish this result in the interior region $$\exp(\log^{2/3+\varepsilon} n) \leq m \leq n - \exp(\log^{2/3+\varepsilon} n)$$ for any fixed ɛ > 0. Indeed, when t is sufficiently large depending on ɛ, we show that there are at most four solutions (or at most two in either half of Pascal’s triangle) in this region. We also establish analogous results for the equation $$(n)_m = t$$, where $$(n)_m := n(n-1) \dots (n-m+1)$$ denotes the falling factorial. 
    more » « less
  2. ; (, International Mathematics Research Notices)
    Abstract Let $$H = N^{\theta }, \theta> 2/3$$ and $$k \geq 1$$. We obtain estimates for the following exponential sum over primes in short intervals: \begin{equation*} \sum_{N < n \leq N+H} \Lambda(n) \mathrm e(g(n)), \end{equation*}where $$g$$ is a polynomial of degree $$k$$. As a consequence of this in the special case $$g(n) = \alpha n^k$$, we deduce a short interval version of the Waring–Goldbach problem. 
    more » « less
  3. ; (, Archiv der Mathematik)
    Full Text Available 
  4. ; (, Discrete analysis)
    Full Text Available 
  5. (, Discrete analysis)
    Full Text Available