Skip to content
DraconiticResearch
Search Sources API
203,234 studies31 sourcesUpdated 17 min ago
PreprintarXiv licencearXiv

Ideal-Smooth Sets and an Explicit Upper Bound for the Real Sum-Product Exponent

Abstract

We construct arbitrarily large finite sets A of real algebraic integers such that both |A+A| and |AA| are at most |A|1.95835. The construction combines truncated ideal-smooth S-unit fibres with a coprime additive factor. A tensor-product rank argument, using a two-dimensional local feature at each selected prime ideal, controls the loss in the additive factor, while a direct estimate for an outer parallel body improves the sumset packing bound. The arithmetic input is an unramified pro-$2$ tower over a known degree-ten field, with simultaneous Frobenius cuts controlling the small prime ideals. We use unconditional Tsfasman--Vlăduţ inequalities for the joint class-number--regulator cost. All finite numerical comparisons entering the exponent are certified by outward rational interval arithmetic. No unproved hypothesis is used.

Related

  1. An explicit lower bound for the growth exponent of three-dimensional loop-erased random walk
    Runsheng Liu
    arXivPreprintarXiv licenceFull textProbabilityarXiv
  2. An Upper Bound to the Undetected Error Exponent with Erasure Decoding at Positive Rates
    Seyed AmirPouya Moeini, Marco Dalai, Albert Guillén i Fàbregas
    arXivPreprintCC BY-NC-SA 4.0Full textGeneral mathematicsarXiv
  3. A new upper bound for the irrationality exponent of zeta(3)
    David Niedbala Giraudin
    arXivPreprintCC BY 4.0Full textAlgebra & number theoryarXiv
  4. Limiter-based fully-discrete entropy stable explicit DG schemes for ideal MHD equations
    Yuchang Liu, Yan Jiang, Zheng Sun
    arXivPreprintarXiv licenceFull textNumerical analysis & scientific computingarXiv
  5. A new upper bound for the irrationality exponent of ζ(2)
    David Niedbala Giraudin
    arXivPreprintCC BY 4.0Full textAlgebra & number theoryarXiv
BibTeX
@misc{zhang2026idealsmooth,
  title = {{Ideal-Smooth Sets and an Explicit Upper Bound for the Real Sum-Product Exponent}},
  author = {Kaiqiang Zhang and Yuanguo Zeng and Yuyu Wang},
  howpublished = {arXiv},
  year = {2026},
  month = oct,
  doi = {10.48550/arxiv.2610.05725},
  eprint = {2610.05725},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2610.05725},
}
RIS
TY  - UNPB
TI  - Ideal-Smooth Sets and an Explicit Upper Bound for the Real Sum-Product Exponent
AU  - Kaiqiang Zhang
AU  - Yuanguo Zeng
AU  - Yuyu Wang
PY  - 2026
DA  - 2026/10/05
PB  - arXiv
DO  - 10.48550/arxiv.2610.05725
UR  - https://arxiv.org/abs/2610.05725
AB  - We construct arbitrarily large finite sets A of real algebraic integers such that both |A+A| and |AA| are at most |A|^1.95835. The construction combines truncated ideal-smooth S-unit fibres with a coprime additive factor. A tensor-product rank argument, using a two-dimensional local feature at each selected prime ideal, controls the loss in the additive factor, while a direct estimate for an outer parallel body improves the sumset packing bound. The arithmetic input is an unramified pro-$2$ tower over a known degree-ten field, with simultaneous Frobenius cuts controlling the small prime ideals. We use unconditional Tsfasman--Vlăduţ inequalities for the joint class-number--regulator cost. All finite numerical comparisons entering the exponent are certified by outward rational interval arithmetic. No unproved hypothesis is used.
ER  -