arXiv (OAI Expanded)
open access
Structural rigidity in the Erdős-Graham two-set permutation problem
Call a permutation of a set of positive integers admissible if it contains no increasing or decreasing three-term arithmetic progression in position order. Davis, Entringer, Graham, and Simmons proved that the positive integers are not admissibly permutable, partitioned them into three admissibly pe
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
- Structural rigidity in the Erdős-Graham two-set permutation problem#925322
- A Risky Problem for Permutation Invariance#100889
- Positionality of Dumont--Thomas numeration systems for integers#160861
- BalLOT: Balanced $k$-means clustering with optimal transport#1155085
- On the representation number of chessboard graphs#1036994
Record · ID 921086
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