Sumset problem for distinct sets of integers
Comptes Rendus. Mathématique · 06.10.2026 · 364 (G3) · 665-672
DOI: 10.5802/crmath.857 ↗Kurz gefasst
Fachartikel in der Zeitschrift Comptes Rendus. Mathématique, online erschienen am 06.10.2026. Verfasst von Gurpreet Kour und 1 weiteren Autor:innen. Die Arbeit nennt 19 Literaturangaben.
Abstract (Originalsprache)
Let A and B be two non-empty finite subsets of integers and n , k ∈ ℤ + . The sum of dilates of sets A and B can be defined: n · A + k · B = n a + k b : a ∈ A , b ∈ B . Under certain assumptions, in 2017, Mistri [ Notes Number Theory Discrete Math. 23 (2017), no. 4] proved that | A + k · B | ≥ 4 | A | - 4 , where A and B are non-empty finite subsets of integers and | k | ≥ 3 . In this article, we consider the sumset p · A + k · B , with k ( > p ) ∈ ℤ + , where p is an odd prime and ( p , k ) = 1 , and prove that | p · A + k · B | ≥ 4 | A | - 4 , where A and B are non-empty finite subsets of integers satisfying some properties. We also rectify the proof of Kaur and Singh [ Comptes Rendus. Mathématique 362 (2024)] and generalize this extended inverse result for arbitrary values of k ∈ ℤ + ( ≥ 2 ) .
Zitieren
APA
Kour, G., & Singh, S. (2026). Sumset problem for distinct sets of integers. Comptes Rendus. Mathématique, 364(G3), 665-672. https://doi.org/10.5802/crmath.857
Vancouver
Kour G, Singh S. Sumset problem for distinct sets of integers. Comptes Rendus. Mathématique. 2026;364(G3):665-672. doi:10.5802/crmath.857
BibTeX
@article{Kour2026,
author = {Kour, Gurpreet and Singh, Sandeep},
title = {Sumset problem for distinct sets of integers},
journal = {Comptes Rendus. Mathématique},
year = {2026},
volume = {364},
number = {G3},
pages = {665--672},
doi = {10.5802/crmath.857}
}
EUVIMED