Datenvertragswerk
bender knuth tableau involution ledger
For one straight semistandard Young tableau on letters 1, 2, 3 with 0..6 cells and one i = 1 or 2, computes its i-th Bender-Knuth involution image. Each i directly above an i+1 is paired and kept fixed; in each row the remaining free a entries i and b entries i+1 are replaced by b entries i followed by a entries i+1. Returns image_tableau, the unchanged shape and original_weight/image_weight. This is one content switch, not all tableaux of a shape.
POST https://datenvertrag.halowerk.com/v1/bender-knuth-tableau-involution-ledgerInputs
| Field | Type | Required | Description |
|---|---|---|---|
| tableau | See schema | Yes | |
| i | 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": 1,
"maximum": 3
},
"minItems": 1,
"maxItems": 6
},
"minItems": 0,
"maxItems": 3
},
{
"type": "null"
}
]
},
"i": {
"anyOf": [
{
"type": "integer",
"minimum": 1,
"maximum": 2
},
{
"type": "null"
}
]
},
"claim": {
"anyOf": [
{
"type": "array",
"items": {
"type": "array",
"items": {
"type": "integer",
"minimum": 1,
"maximum": 3
},
"minItems": 1,
"maxItems": 6
},
"minItems": 0,
"maxItems": 3
},
{
"type": "null"
}
]
}
},
"required": [
"tableau",
"i",
"claim"
],
"additionalProperties": false
}Published input example
{
"tableau": [],
"i": 1,
"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.