Restricted sumsets in multiplicative subgroups

Abstract We establish the restricted sumset analog of the celebrated conjecture of Sárközy on additive decompositions of the set of nonzero squares over a finite field. More precisely, we show that if $q>13$ is an odd prime power, then the set of nonzero squares in $\mathbb {F}_q$ cannot be written as a restricted sumset $A \hat {+} A$ , extending a result of Shkredov. More generally, we study restricted sumsets in multiplicative subgroups over finite fields as well as restricted sumsets in perfect powers (over integers) motivated by a question of Erdős and Moser. We also prove an analog of van Lint–MacWilliams’ conjecture for restricted sumsets, which appears to be the first analogue of Erdős--Ko–Rado theorem in a family of Cayley sum graphs.

Authors

Institutions

Publication Details

Journal
Canadian Journal of Mathematics
Published
2025-01-09
DOI
https://doi.org/10.4153/s0008414x24000920
Citations
2
Primary Topic
Limits and Structures in Graph Theory
Type
article
Field-Weighted Citation Impact
10.66
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Restricted sumsets in multiplicative subgroups

Chi Hoi Yip
2 citations
Canadian Journal of Mathematics
Limits and Structures in Graph Theory
10.66
article

Restricted sumsets in multiplicative subgroups

Chi Hoi Yip
article en
2 citations

Abstract

Abstract We establish the restricted sumset analog of the celebrated conjecture of Sárközy on additive decompositions of the set of nonzero squares over a finite field. More precisely, we show that if $q>13$ is an odd prime power, then the set of nonzero squares in $\mathbb {F}_q$ cannot be written as a restricted sumset $A \hat {+} A$ , extending a result of Shkredov. More generally, we study restricted sumsets in multiplicative subgroups over finite fields as well as restricted sumsets in perfect powers (over integers) motivated by a question of Erdős and Moser. We also prove an analog of van Lint–MacWilliams’ conjecture for restricted sumsets, which appears to be the first analogue of Erdős--Ko–Rado theorem in a family of Cayley sum graphs.

Canadian Journal of MathematicsVol. 78(2)
Georgia Institute of Technology (US)
Openalex Percentile: Top 3%
Limits and Structures in Graph Theory
10.66
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.