Jin-Hui Fang

dblp:45/3297 · DBLP profile ↗
← Back
4ranked-venue papers
3as first author
2since 2021 · last 2026
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Theory of computation · 4 · 3 first-author · 2 since 2021
YearPublicationVenuePosition
2026 Dense subsets of asymptotic bases
Jin-Hui Fang
Discret. Appl. Math.1
2023 On exponential type sequences
Fanggang Xue, Jin-Hui Fang
Discret. Appl. Math.2
2020 On Generalized Perfect Difference Sumsets
abstract
Let $\mathbb{Z}$ be the set of integers and $\mathbb{N}$ be the set of positive integers. For a nonempty set $A$ of integers and any integers $n$, $h\ge 2$, denote $r_{A,h}(n)$ by the number of representations of $n$ of the form $n=a_1+a_2+\cdots+a_h$, where $a_1\le \cdots \le a_h$ and $a_i\in A$ for $i=1,2,\ldots,h$ and $d_{A}(n)$ by the number of $(a,a')$ with $a,a'\in A$ such that $n=a-a'$. The set $A$ of integers is called a perfect difference sumset if $r_{A,2}(n)=1$ for all integers $n$ and $d_A(n)=1$ for all positive integers $n$. In this paper, we consider generalized perfect difference sumsets and prove that, if two functions $f_1:\mathbb{N}\rightarrow \mathbb{N}$ and $f_2:\mathbb{Z}\rightarrow \mathbb{N}$ satisfy that $\liminf_{u\rightarrow \infty}f_1(u)\ge 2$ and $\liminf_{|u|\rightarrow \infty}f_2(u)\ge 2$, then there exists a set $A$ of integers such that (i) $d_A(n)=f_1(n)$ for all $n\in \mathbb{N}$ and $r_{A,2}(n)=f_2(n)$ for all $n\in \mathbb{Z}$; (ii) $\limsup_{x\rightarrow\infty} A(-x,x)/\sqrt{x}\ge 1/\sqrt{2}$. Furthermore, following Cilleruelo and Nathanson's work, we proved that there exists a set $A$ of integers such that (i) $r_{A,3}(n)=2$ for all $n\in \mathbb{Z}$ and $d_A(n)=1$ for all $n\in \mathbb{N}$; (ii) $A(x)\gg x^{\sqrt{5}-2+o(1)}$.
Jin-Hui Fang
SIAM J. Discret. Math.1
2008 On a conjecture of Erdös, Graham and Spencer, II
Jin-Hui Fang, Yong-Gao Chen
Discret. Appl. Math.1