Search arXivSearch

arXiv · 2609.10148

Infinite Families of Counterexamples to a Conjecture of Liu and Qian and a Refined Inverse Theorem for Restricted Sumsets in $\mathbb{Z}_p$

Abstract

Let $p$ be a prime and let $A,B$ be nonempty subsets of the cyclic group $\mathbb{Z}_p$ with $|A|\neq |B|$. The Alon--Nathanson--Ruzsa theorem gives the lower bound $|A\rplus B|\ge \min\{p,\,|A|+|B|-2\},$ where $A\rplus B=\{a+b:a\in A,\ b\in B,\ a\neq b\}$ is the restricted sumset. The inverse problem of characterizing all critical pairs $(A,B)$ attaining equality was posed by Alon, Nathanson, and Ruzsa in 1996 and remains open. Recently, Liu and Qian solved the inverse problem under the assumption that at least one of the sets is an arithmetic progression, and proposed a conjecture for the general case. The main purpose of this paper is to show that this conjecture fails in the boundary case $|A|+|B|=p$. More precisely, we construct infinite families of non-arithmetic critical pairs $(A,B)$ with $|A|+|B|=p$ and $|A\rplus B|=p-2$ for every prime $p\ge 11$. These families show that the boundary case is fundamentally different from the non-boundary case. Motivated by this, we formulate and prove a refined inverse theorem under the natural hypothesis $|A|+|B|\le p-1$, which excludes the boundary.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Jiantao Li, Xinyi Liang. 2026-09-11. Infinite Families of Counterexamples to a Conjecture of Liu and Qian and a Refined Inverse Theorem for Restricted Sumsets in $\mathbb{Z}_p$. https://arxiv.org/abs/2609.10148

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Asymptotic density of k-almost primes

Landau's well known asymptotic formula $$N_k(x):=\ \mid\{n\leq x : Ω(n)=k\}\mid \ \sim \left( \frac{x}{\log x} \right) \frac{(\log\log x)^{k-1}}{(k - 1)!}\ \ (x \rightarrow \infty),$$ which also holds for $$π_k(x):=\ \mid\{n\leq x : ω(n)=k\}\mid,$$ is known to be fairly poor for $k > 1$, and when $k$ is allowed to tend to infinity with $x$, the study of $N_k(x)$ and $π_k(x)$ becomes very technical [1, Chapter II.6, $§$ 6.1, p.200]. I hope to show that the method described below provides not only a more accurate approach, but rather increases in its asymptotic accuracy as $k$ tends to infinity.

math.NT

Transcendence Meets Normality: Construction of Transcendentally Normal Numbers

In this work, we study real numbers $x$ for which $p(x)$ is (absolutely) normal for every non-constant integer-valued polynomial $p$. We call such numbers transcendentally normal. We prove that almost every real number is transcendentally normal and provide an explicit construction of such a number, based on Sierpinski's covering method and novel ideas involving the so-called stretch function. In the next step, we transform this construction into an algorithm that computes the digits of a t-normal number recursively in all integer bases. Moreover, we extend our covering approach to construct and compute LIL-normal numbers whose discrepancies are of the order predicted by the law of the iterated logarithm. We also take the opportunity to discuss several interesting open problems.

math.NT