arXiv (All)
open access
Infinite Sum-Product Configurations in Parallel
We show that for any finite partition of $\mathbb{N}$ 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 ar
Conceptio Open Archive
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.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Monochromatic Sums and Products with Additive or Multiplicative Shifts in Natural Numbers#1000467
- Clonoids of Boolean functions with a monotone or discriminator source clone#972864
- A 4AP-free permutation of the positive integers#1070248
- Thresholds and Fluctuations for Colorful Arithmetic Progressions in Sparse Random Colorings#1084973
- Nonnesting permutations avoiding 123#973323
Record · ID 1048328
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive