HALOWERKDatenvertragswerk
semistandard shape weight family
For an original partition shape with at most7cells and exactly three nonnegative content counts summing to that size, reconstruct ALL semistandard Young tableaux on letters1,2,3. English convention: longer left-aligned rows above, rows weakly increasing and columns strictly increasing. Whole tableaux sort by numeric row-major lexorder. Return their exact Kostka cardinality and each complete prefix-shape chain for thresholds0,1,2,3, retaining repeated shapes. Empty shape/zero content has one.
POST https://datenvertrag.halowerk.com/v1/semistandard-shape-weight-familyEingaben
| Feld | Typ | Pflicht | Beschreibung |
|---|---|---|---|
| shape | Siehe Schema | Ja | |
| weight | Siehe Schema | Ja | |
| claimed_tableaux | Siehe Schema | Ja |
Vollständiges Eingabeschema anzeigen
{
"type": "object",
"additionalProperties": false,
"required": [
"shape",
"weight",
"claimed_tableaux"
],
"properties": {
"shape": {
"anyOf": [
{
"type": "array",
"maxItems": 7,
"items": {
"type": "integer",
"minimum": 1,
"maximum": 7
}
},
{
"type": "null"
}
]
},
"weight": {
"anyOf": [
{
"type": "array",
"maxItems": 3,
"items": {
"type": "integer",
"minimum": 0,
"maximum": 7
},
"minItems": 3
},
{
"type": "null"
}
]
},
"claimed_tableaux": {
"anyOf": [
{
"type": "array",
"maxItems": 64,
"items": {
"type": "array",
"maxItems": 7,
"items": {
"type": "array",
"maxItems": 7,
"items": {
"type": "integer",
"minimum": 1,
"maximum": 3
}
}
}
},
{
"type": "null"
}
]
}
}
}Veröffentlichtes Eingabebeispiel
{
"shape": [
3,
2,
1
],
"weight": [
2,
2,
2
],
"claimed_tableaux": [
[
[
1,
1,
2
],
[
2,
3
],
[
3
]
],
[
[
1,
1,
3
],
[
2,
2
],
[
3
]
]
]
}Ergebnis & Dokumentation
Maschinenlesbare Dokumentation dieses Hubs
Quelle dieser Seite: der veröffentlichte HALOWERK-Katalog. Stand: 2026-11-07, 02:42 UTC.
Weitere Endpunkte dieses Hubs
- Datenvertragswerk0,003 USDC
adjacency cospectral graph family
POSThttps://datenvertrag.halowerk.com/v1/adjacency-cospectral-graph-familyGiven n1..5 and a monic degree-n integer polynomial det(xI-A), return EVERY labelled simple undirected graph on vertices0..n-1 having exactly that adjacency characteristic polynomial over integers. Coefficients are descending degree order,
- 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.
- Datenvertragswerk0,003 USDC
aligned record cut audit
POSThttps://datenvertrag.halowerk.com/v1/aligned-record-cut-auditA stream-runtime fixture maintainer checks which record IDs belong to a supplied aligned checkpoint cut and which same-channel post-barrier records must stay buffered until all input barriers arrive. One aligned local checkpoint;record iden