Datenvertragswerk
symmetric function schur plethysm
Compute the COMPLETE ordinary OUTER Schur plethysm s_lambda[s_mu] over QQ in the stable symmetric-function ring. outer_partition is lambda and inner_partition is mu. Each source partition is exactly[1],[2],or[1,1], so source sizes1..2 and totaldegree |lambda|*|mu|<=4. These own finite bounds are not limits of the official definition. Return every NONZERO integer coefficient in Schur basis, indexing partitions in descending lexicographic order, zero terms omitted, degree and complete..
POST https://datenvertrag.halowerk.com/v1/symmetric-function-schur-plethysmInputs
| Field | Type | Required | Description |
|---|---|---|---|
| outer_partition | See schema | Yes | |
| inner_partition | See schema | Yes | |
| claim | See schema | No |
Show full input schema
{
"type": "object",
"properties": {
"outer_partition": {
"anyOf": [
{
"enum": [
[
1
],
[
2
],
[
1,
1
]
]
},
{
"type": "null"
}
]
},
"inner_partition": {
"anyOf": [
{
"enum": [
[
1
],
[
2
],
[
1,
1
]
]
},
{
"type": "null"
}
]
},
"claim": {
"anyOf": [
{
"type": "array",
"items": {
"type": "object",
"properties": {
"partition": {
"type": "array",
"items": {
"type": "integer",
"minimum": 1,
"maximum": 4
},
"minItems": 1,
"maxItems": 4
},
"coefficient": {
"type": "integer",
"minimum": 1,
"maximum": 24
}
},
"required": [
"partition",
"coefficient"
],
"additionalProperties": false
},
"maxItems": 5
},
{
"type": "null"
}
]
}
},
"required": [
"outer_partition",
"inner_partition"
],
"additionalProperties": false
}Published input example
{
"outer_partition": [
2
],
"inner_partition": [
2
]
}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.