Datenvertragswerk
pak reverse plane partition ledger
From one weak reverse plane partition in English convention (nonempty rows with weakly decreasing lengths, total 0..4 cells, entries 0..3 weakly increasing across rows and columns), reconstructs its entire Pak correspondence image xi_lambda, the inverse Sulzgruber bijection, as a nonnegative array of the same shape. Returns the whole array, the original shape, the cell hook_table, the volume and the equal hook_weighted_volume. It is not inverse Hillman-Grassl.
POST https://datenvertrag.halowerk.com/v1/pak-reverse-plane-partition-ledgerInputs
| Field | Type | Required | Description |
|---|---|---|---|
| tableau | See schema | Yes | |
| claim | See schema | Yes |
Show full input schema
{
"type": "object",
"properties": {
"tableau": {
"anyOf": [
{
"type": "array",
"items": {
"type": "array",
"items": {
"type": "integer",
"minimum": 0,
"maximum": 3
},
"minItems": 0,
"maxItems": 4
},
"minItems": 0,
"maxItems": 4
},
{
"type": "null"
}
]
},
"claim": {
"anyOf": [
{
"type": "array",
"items": {
"type": "array",
"items": {
"type": "integer",
"minimum": 0,
"maximum": 12
},
"minItems": 0,
"maxItems": 4
},
"minItems": 0,
"maxItems": 4
},
{
"type": "null"
}
]
}
},
"required": [
"tableau",
"claim"
],
"additionalProperties": false
}Published input example
{
"tableau": [],
"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.