Datenvertragswerk
poset evacuation action ledger
Reconstructs the complete Schuetzenberger evacuation action on all linear extensions of one labelled finite poset on labels 0..n-1 (n 0..4). relations is the entire strict transitive relation: row a, bit b means a<b. Extensions are enumerated in numeric lex order and each is mapped to its evacuated extension by the remove, slide and freeze procedure of Stanley 0806.4717 Section 2. No natural numeric labelling is assumed and no Hasse closure is inferred.
POST https://datenvertrag.halowerk.com/v1/poset-evacuation-action-ledgerInputs
| Field | Type | Required | Description |
|---|---|---|---|
| relations | See schema | Yes | |
| claim | See schema | Yes |
Show full input schema
{
"type": "object",
"properties": {
"relations": {
"anyOf": [
{
"type": "array",
"items": {
"type": "integer",
"minimum": 0,
"maximum": 15
},
"minItems": 0,
"maxItems": 4
},
{
"type": "null"
}
]
},
"claim": {
"anyOf": [
{
"type": "array",
"items": {
"type": "integer",
"minimum": 0,
"maximum": 23
},
"minItems": 0,
"maxItems": 24
},
{
"type": "null"
}
]
}
},
"required": [
"relations",
"claim"
],
"additionalProperties": false
}Published input example
{
"relations": [],
"claim": [
0
]
}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.