Datenvertragswerk
symmetric group kronecker decomposition
For two original partitions left/right of the SAME integer n0..5, synthesize the COMPLETE internal Kronecker tensor-product decomposition of the corresponding irreducible representations of S_n. Partition arrays have positive integer parts in nonincreasing order and total at most5. Empty[] is the unique partition of0, NOT missing. Output partitions lists EVERY partition of n in numeric lexicographic order; aligned multiplicities gives each nonnegative irreducible multiplicity, INCLUDING zero.
POST https://datenvertrag.halowerk.com/v1/symmetric-group-kronecker-decompositionInputs
| Field | Type | Required | Description |
|---|---|---|---|
| left | See schema | Yes | |
| right | See schema | Yes | |
| claim | See schema | Yes |
Show full input schema
{
"type": "object",
"properties": {
"left": {
"anyOf": [
{
"type": "array",
"items": {
"type": "integer",
"minimum": 1,
"maximum": 5
},
"minItems": 0,
"maxItems": 5
},
{
"type": "null"
}
]
},
"right": {
"anyOf": [
{
"type": "array",
"items": {
"type": "integer",
"minimum": 1,
"maximum": 5
},
"minItems": 0,
"maxItems": 5
},
{
"type": "null"
}
]
},
"claim": {
"anyOf": [
{
"type": "object",
"properties": {
"partitions": {
"type": "array",
"items": {
"type": "array",
"items": {
"type": "integer",
"minimum": 1,
"maximum": 5
},
"minItems": 0,
"maxItems": 5
},
"minItems": 0,
"maxItems": 7
},
"multiplicities": {
"type": "array",
"items": {
"type": "integer",
"minimum": 0,
"maximum": 100
},
"minItems": 0,
"maxItems": 7
},
"dimension": {
"type": "integer",
"minimum": 0,
"maximum": 100
}
},
"required": [
"partitions",
"multiplicities",
"dimension"
],
"additionalProperties": false
},
{
"type": "null"
}
]
}
},
"required": [
"left",
"right",
"claim"
],
"additionalProperties": false
}Published input example
{
"left": [],
"right": [],
"claim": {
"partitions": [
[]
],
"multiplicities": [
1
],
"dimension": 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.