Skip to content
DraconiticResearch
Search Sources API
197,688 studies31 sourcesUpdated 17 min ago
PreprintarXiv licencearXiv

Infinite Sum-Product Configurations in Parallel

Abstract

We show that for any finite partition of ℕ there is an infinite sequence whose finite sums are monochromatic and such that infinitely many of the products with a fixed number of factors are monochromatic -- though not necessarily belonging to the same color class as the finite sums. We are able to build these infinite configurations in parallel by refining arbitrary partitions of ℕ. We apply these techniques to prove that many complex infinite sum-product configurations are guaranteed to be monochromatic for arbitrary finite colorings of ℕ.

Related

  1. Solutions to several problems on infinite sumset configurations
    Shisheng Li, Yong Su
    arXivPreprintCC BY 4.0Full textAlgebra & number theoryCombinatorics & discrete mathematicsarXiv
  2. Infinite Product Formula Involving the Catalan's Constant
    Antonio Gracia Llorente
    OSF PreprintsPreprintCC BY 4.0Full textAlgebra & number theoryOSF
  3. Indecomposable characters of the wreath product of a torus by the infinite block-diagonal symmetric group
    Nikolay Nessonov, Nhok Tkhai Shon Ngo
    arXivPreprintCC BY 4.0Full textAlgebra & number theoryAnalysis & PDEsarXiv
  4. On the Malliavin calculus on product spaces and an infinite de Jong theorem
    Christian Döbler
    arXivPreprintarXiv licenceFull textProbabilityarXiv
  5. Fast computation and convergence analysis of the infinite-product representation of the Schottky--Klein prime function
    Shuntaro Yamamoto, Hiroyuki Miyoshi
    arXivPreprintarXiv licenceFull textNumerical analysis & scientific computingarXiv
BibTeX
@misc{griffin2026infinite,
  title = {{Infinite Sum-Product Configurations in Parallel}},
  author = {Conner Griffin},
  howpublished = {arXiv},
  year = {2026},
  month = sep,
  doi = {10.48550/arxiv.2605.24751},
  eprint = {2605.24751},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2605.24751},
}
RIS
TY  - UNPB
TI  - Infinite Sum-Product Configurations in Parallel
AU  - Conner Griffin
PY  - 2026
DA  - 2026/09/19
PB  - arXiv
DO  - 10.48550/arxiv.2605.24751
UR  - https://arxiv.org/abs/2605.24751
AB  - We show that for any finite partition of ℕ there is an infinite sequence whose finite sums are monochromatic and such that infinitely many of the products with a fixed number of factors are monochromatic -- though not necessarily belonging to the same color class as the finite sums. We are able to build these infinite configurations in parallel by refining arbitrary partitions of ℕ. We apply these techniques to prove that many complex infinite sum-product configurations are guaranteed to be monochromatic for arbitrary finite colorings of ℕ.
ER  -