Datenvertragswerk
poset promotion action ledger
For one arbitrary finite poset on labels 0..n-1 (n 0..4), given as the entire strict order (row u, bit v means u<v, transitive closure already captured), reconstructs the whole Schuetzenberger promotion action on all its linear extensions. Returns the extensions in numeric lex order, next_indices aligned with them, and all cycles of this permutation with their count. A complete action and cycle census, not just one orbit from a caller-supplied initial extension.
POST https://datenvertrag.halowerk.com/v1/poset-promotion-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": "object",
"properties": {
"extensions": {
"type": "array",
"items": {
"type": "array",
"items": {
"type": "integer",
"minimum": 0,
"maximum": 3
},
"minItems": 0,
"maxItems": 4
},
"minItems": 0,
"maxItems": 24
},
"next_indices": {
"type": "array",
"items": {
"type": "integer",
"minimum": 0,
"maximum": 23
},
"minItems": 0,
"maxItems": 24
},
"cycles": {
"type": "array",
"items": {
"type": "array",
"items": {
"type": "integer",
"minimum": 0,
"maximum": 23
},
"minItems": 1,
"maxItems": 24
},
"minItems": 0,
"maxItems": 24
},
"count": {
"type": "integer",
"minimum": 0,
"maximum": 24
}
},
"required": [
"extensions",
"next_indices",
"cycles",
"count"
],
"additionalProperties": false
},
{
"type": "null"
}
]
}
},
"required": [
"relations",
"claim"
],
"additionalProperties": false
}Published input example
{
"relations": [],
"claim": {
"extensions": [
[]
],
"next_indices": [
0
],
"cycles": [
[
0
]
],
"count": 1
}
}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.