Multiplicative structure of shifted multiplicative subgroups and its applications to Diophantine tuples
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
[2309.09124] Multiplicative structure of shifted multiplicative subgroups and its applications to Diophantine tuples Skip to main content Search Submit Donate Log in Search arXiv Press Enter to search · Advanced search Mathematics > Number Theory arXiv:2309.09124 (math) [Submitted on 17 Sep 2023 ( v1 ), last revised 12 Feb 2025 (this version, v4)] Title: Multiplicative structure of shifted multiplicative subgroups and its applications to Diophantine tuples Authors: Seoyoung Kim , Chi Hoi Yip , Semin Yoo View a PDF of the paper titled Multiplicative structure of shifted multiplicative subgroups and its applications to Diophantine tuples, by Seoyoung Kim and 2 other authors View PDF HTML (experimental) Abstract: In this paper, we investigate the multiplicative structure of a shifted multiplicative subgroup and its connections with additive combinatorics and the theory of Diophantine equations. Among many new results, we highlight our main contributions as follows. First, we show that if a nontrivial shift of a multiplicative subgroup $G$ contains a product set $AB$, then $|A||B|$ is essentially bounded by $|G|$, refining a well-known consequence of a classical result by Vinogradov. Second, we provide a sharper upper bound of $M_k(n)$, the largest size of a set such that each pairwise product of its elements is $n$ less than a $k$-th power, refining the recent result of Dixit, Kim, and Murty. One main ingredient in our proof is the first non-trivial upper bound on the maximum size of a generalized Diophantine tuple over a finite field. In addition, we determine the maximum size of an infinite family of generalized Diophantine tuples over finite fields with square order, which is of independent interest. We also make significant progress towards a conjecture of Sárközy on the multiplicative decompositions of shifted multiplicative subgroups. In particular, we prove that for almost all primes $p$, the set $\{x^2-1: x \in \mathbb{F}_p^*\} \setminus \{0\}$ cannot be decomposed as the product of two sets in $\mathbb{F}_p$ non-trivially. Comments: 33 pages, 1 figure. Title changed, revised based on referee comments Subjects: Number Theory (math.NT) MSC classes: Primary 11B30, 11D72, Secondary 11D45, 11N36, 11L40 Cite as: arXiv:2309.09124 [math.NT] (or arXiv:2309.09124v4 [math.NT] for this version) https://doi.org/10.48550/arXiv.2309.09124 Focus to learn more arXiv-issued DOI via DataCite Journal reference: Canad. J. Math., 2026 Related DOI : https://doi.org/10.4153/S0008414X25000136 Focus to learn more DOI(s) linking to related resources Submission history From: Chi Hoi Yip [ view email ] [v1] Sun, 17 Sep 2023 01:21:39 UTC (86 KB) [v2] Sun, 8 Oct 2023 02:46:29 UTC (85 KB) [v3] Tue, 3 Sep 2024 00:53:49 UTC (83 KB) [v4] Wed, 12 Feb 2025 14:59:39 UTC (87 KB) Full-text links: Access Paper: View a PDF of the paper titled Multiplicative structure of shifted multiplicative subgroups and its applications to Diophantine tuples, by Seoyoung Kim and 2 other authors View PDF HTML (experimental) TeX Source view license Current browse context: math.NT < prev | next > new | recent | 2023-09 Change to browse by: math References & Citations NASA ADS Google Scholar Semantic Scholar export BibTeX citation Loading... BibTeX formatted citation × loading... Data provided by: Bookmark Bibliographic Tools Bibliographic and Citation Tools Bibliographic Explorer Toggle Bibliographic Explorer ( What is the Explorer? ) Connected Papers Toggle Connected Papers ( What is Connected Papers? ) Litmaps Toggle Litmaps ( What is Litmaps? ) scite.ai Toggle scite Smart Citations ( What are Smart Citations? ) Code, Data, Media Code, Data and Media Associated with this Article alphaXiv Toggle alphaXiv ( What is alphaXiv? ) Links to Code Toggle CatalyzeX Code Finder for Papers ( What is CatalyzeX? ) DagsHub Toggle DagsHub ( What is DagsHub? ) GotitPub Toggle Gotit.pub ( What is GotitPub? ) Huggingface Toggle Hugging Face ( What is Huggingface? ) ScienceCast Toggle ScienceCast ( What is ScienceCast? ) Demos Demos Replicate Toggle Replicate ( What is Replicate? ) Spaces Toggle Hugging Face Spaces ( What is Spaces? ) Spaces Toggle TXYZ.AI ( What is TXYZ.AI? ) Related Papers Recommenders and Search Tools Link to Influence Flower Influence Flower ( What are Influence Flowers? ) Core recommender toggle CORE Recommender ( What is CORE? ) Author Venue Institution Topic About arXivLabs arXivLabs: experimental projects with community collaborators arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website. Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them. Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs . Which authors of this paper are endorsers? | Disable MathJax ( What is MathJax? ) We gratefully acknowledge support from our major funders , member institutions , , and all contributors. About · Help · Contact · Subscribe · Copyright · Privacy · Accessibility · Operational Status (opens in new tab) Major funding support from
Related documents
- Matchings and product growth in modular abelian independence groups#1048778
- Diffie-Hellman Proof-of-Possession Algorithms#139546
- Product structures and decompositions of $\mathbb{Z}_2\times\mathbb{Z}_2$-symmetric spaces#996575
- The conjugacy problem in cyclic extensions of one-ended hyperbolic groups#635966
- The conjugacy problem in cyclic extensions of one-ended hyperbolic groups#633617
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive