Problem packetResearch packetR757
Schwartz proved the zero-based ancestor in 1978
Link to a section
The record cites sources for its explanation.
Recorded status: established
Recorded scope: every finite initial interval indexed from zero
Complete recorded scope and conditions
{
"kind": "universal",
"statement": "every finite initial interval indexed from zero"
}Originating problem: Permutations whose index sums are always perfect squares
Authored record and scope
- Authored title
- Schwartz proved the zero-based ancestor in 1978
- Record type
- claim
- Stored status
- established
- Evidence grade
- sourced
- Recorded scope data
- { "kind": "universal", "statement": "every finite initial interval indexed from zero" }
2Authored explanation
Benjamin Schwartz introduced square permutations in Mathematics Magazine and proved existence on every zero-based initial interval. The indexing changes the answer: the zero-based problem has no exceptional orders, while the one-based candidate has six. Both use the same reflection construction. This source also separates the entry from the square-sum sequencing puzzle, which asks for a Hamiltonian path rather than a bipartite perfect matching.
Continue this work
Replay material: source only
3Evidence
A verification source is cited. This record has no executable replay attached.
Verification source: doi.org ↗, Benjamin L. Schwartz, Square Permutations, Mathematics Magazine 51 (1978), pages 64-66
4How it connects
Informs
- claim
Recorded for
- problem
Cite this record
Cite the original sources separately.
Machine-readable record
Copy the structured record when continuing this work with an agent.
{
"schema": "theoremdb-agent-record-v1",
"ref": "R757",
"content_hash": null,
"slug": "ssp-claim-zero-based-ancestor",
"type": "claim",
"title": "Schwartz proved the zero-based ancestor in 1978",
"summary": "For every \\(m\\geq0\\), the set \\(\\{0,\\ldots,m\\}\\) has a permutation whose termwise sums are squares.",
"relevance": "This records a result, observation, or conjecture used to assess the target problem.",
"relevance_source": "derived",
"body": "Benjamin Schwartz introduced square permutations in Mathematics Magazine and proved existence on every zero-based initial interval. The indexing changes the answer: the zero-based problem has no exceptional orders, while the one-based candidate has six. Both use the same reflection construction. This source also separates the entry from the square-sum sequencing puzzle, which asks for a Hamiltonian path rather than a bipartite perfect matching.",
"status": "established",
"evidence_grade": "sourced",
"scope": {
"kind": "universal",
"statement": "every finite initial interval indexed from zero"
},
"reproduction": {
"schema": "theoremdb-reproduction-v1",
"readiness": "source_only",
"kind": "claim",
"citation": {
"url": "https://doi.org/10.1080/0025570X.1978.11976678",
"locator": "Benjamin L. Schwartz, Square Permutations, Mathematics Magazine 51 (1978), pages 64-66"
},
"missing": [
"source",
"command",
"runtime",
"expected_output"
]
},
"formal_statement": null,
"source": {
"url": "https://doi.org/10.1080/0025570X.1978.11976678",
"locator": "Benjamin L. Schwartz, Square Permutations, Mathematics Magazine 51 (1978), pages 64-66"
},
"models": [],
"continuation": null,
"relations": [
{
"slug": "R756",
"title": "The six listed orders are the exact exception set",
"object_type": "claim",
"relation": "informs",
"direction": "outgoing"
},
{
"slug": "square-sum-permutation-existence",
"title": "square sum permutation existence",
"object_type": "problem",
"relation": "recorded_for",
"direction": "outgoing"
}
]
}6Provenance
View source, identifiers, and projection details
A statement this project treats as settled at the recorded evidence grade, with the work that backs it.