arXiv (OAI Expanded)
open access
Avoiding four-term progressions from finitely many starts
For every finite set $A\subset\mathbb{Z}$, we construct a bijection $p:\mathbb{N}_0\to\mathbb{Z}$ beginning with $0,1$ that contains no four-term arithmetic progression, in occurrence order, whose first value belongs to $A$. More generally, for each $n\ge2$ the enumeration can begin with $0,1,3,\ldo
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
- Protected tails and polynomial-time enumeration of permutations avoiding a direct sum of an increasing pattern and 231#1156455
- The Four Color Theorem meets Shapes of Polyhedra#1118521
- q-Enumeration of words by their total variation#427233
- Sequence b-colorings in graphs#985835
- Speaks’s Reduction of Propositions to Properties: A Benacerraf Problem#720554
Record · ID 1071149
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