OpenAlex ·
Infinite Families of Counterexamples to a Conjecture of Liu and Qian and a Refined Inverse Theorem for Restricted Sumsets in $\mathbb{Z}_p$
- Published
- Source
- OpenAlex
- Published in
- arXiv (Cornell University)
- DOI
- 10.48550/arxiv.2609.10148
- Original
- Read it at the publisher
- Topics
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.
The authors’ abstract, as arXiv lists it. arXiv’s listings, abstracts included, are free for anyone to reuse.
Read it on ReadSearch
Each opens after you create an account, and brings you back to this paper.
More in Combinatorics
Get the few papers worth your time in Combinatorics every morning.
ReadSearch reads the new papers in your field each day and brings you the few worth reading, each with its key finding in a sentence.