Datenvertragswerk
glaisher distinct to odd partition ledger
For one integer partition into distinct positive parts (distinct_parts strictly descending, each part 1..20, total weight 0..20), reconstructs its Glaisher image partition into odd positive parts: each original part 2^a*m with m odd contributes 2^a copies of m. Returns the entire ordered odd_parts array, the preserved weight, source_length and target_length; [6,3,1] maps to [3,3,3,1]. This is the distinct-to-odd direction of the Glaisher bijection (Pak Section 9).
POST https://datenvertrag.halowerk.com/v1/glaisher-distinct-to-odd-partition-ledgerInputs
| Field | Type | Required | Description |
|---|---|---|---|
| distinct_parts | See schema | Yes | |
| claim | See schema | Yes |
Show full input schema
{
"type": "object",
"properties": {
"distinct_parts": {
"anyOf": [
{
"type": "array",
"items": {
"type": "integer",
"minimum": 1,
"maximum": 20
},
"minItems": 0,
"maxItems": 5
},
{
"type": "null"
}
]
},
"claim": {
"anyOf": [
{
"type": "array",
"items": {
"type": "integer",
"minimum": 1,
"maximum": 20
},
"minItems": 0,
"maxItems": 20
},
{
"type": "null"
}
]
}
},
"required": [
"distinct_parts",
"claim"
],
"additionalProperties": false
}Published input example
{
"distinct_parts": [],
"claim": []
}Result & documentation
Machine-readable documentation of this hub
Source of this page: the published HALOWERK catalog. Updated: 2026-11-17 UTC.
More endpoints in this hub
- Datenvertragswerk0.003 USDC
acyclic automata probabilistic refinement witness
POSThttps://datenvertrag.halowerk.com/v1/acyclic-automata-probabilistic-refinement-witnessFor two finite action-labelled nondeterministic probabilistic automata return the WHOLE greatest DIRECTED STRONG SIMULATION relation, canonical single-transition matching couplings and exhaustive local negative Hall obstructions. Each of 1.
- Datenvertragswerk0.003 USDC
adjacency cospectral graph family
POSThttps://datenvertrag.halowerk.com/v1/adjacency-cospectral-graph-familyGiven n in 1..5 and a monic degree-n integer polynomial det(xI-A), returns every labelled simple undirected graph on vertices 0..n-1 with exactly that adjacency characteristic polynomial. Coefficients are in descending degree order, n+1 ent
- Datenvertragswerk0.003 USDC
adjacent swap permutation tour
POSThttps://datenvertrag.halowerk.com/v1/adjacent-swap-permutation-tourFor 0 to 5 labels starting at zero, construct the whole Steinhaus-Johnson-Trotter permutation tour from identity. Each transition swaps the largest mobile value with its adjacent smaller neighbor, then reverses directions of greater values.