arXiv (All)
open access
Generating and generalizing MSTD sets through Markov processes
The classical More Sums Than Differences (MSTD) problem studies finite sets $A\subset\{0,1,\ldots,n\}$ for which $|A+A|>|A-A|$, where $A+A=\{a_1+a_2:a_1,a_2\in A\}$ and $A-A=\{a_1-a_2:a_1,a_2\in A\}$. As addition is commutative and subtraction is not, it was conjectured that as $n\to\infty$ almost a
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
- Consequences of Assigning Non-Measurable Sets Imprecise Probabilities#90181
- Szemerédi's theorem with random differences and arithmetic Kakeya#1344348
- Breaking the Infinite Barrier in the $\frac{1}{3}$--$\frac{2}{3}$ Conjecture#1105447
- Cutoff for the Overhand Shuffle#1154760
- A Simpler Proof of Kakutani's Conjecture on Random Subdivision and Its Generalizations#986790
Record · ID 1218129
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