Xue-Gong Sun

collaborators

2 papers

math.NT2015

On a problem of Terence Tao

Xue-Gong Sun

In this paper, we solve a problem of Terence Tao. We prove that for any $K \geq 2$ and sufficiently large $N$ , the number of primes $p$ between $N$ and $(1 + \frac{1}{K}) N$ such that…

math.CO2014

Enumerations of humps and peaks in $(k, a)$ -paths and $(n, m)$ -Dyck paths via bijective proofs

Rosena R. X. Du, Yingying Nie, Xuezhi Sun

Recently Mansour and Shattuck studied $(k, a)$ -paths and gave formulas that relate the total number of humps (peaks) in all $(k, a)$ -paths to the number of super $(k, a)$ -paths. These…

On a problem of Terence Tao

Enumerations of humps and peaks in (k,a)-paths and (n,m)-Dyck paths via bijective proofs

Enumerations of humps and peaks in $(k, a)$ -paths and $(n, m)$ -Dyck paths via bijective proofs