HALOWERKDatenvertragswerk
partition hook multiset inverse family
Given an original multiset of0..20positive hooklengths each1..20, reconstruct EVERY integer partition of that cellcount whose English Ferrers diagram has exactly that hookmultiset. Hook counts self plus cells strictlyright and strictlybelow. Return all shapes in numeric lexicographic order, complete rowaligned hooktableau for each shape, exact familycount. Repeated hooks preserved; input hookorder ignored; supplied shapeclaim compares entire ordered inversefamily, not merely count or one.
POST https://datenvertrag.halowerk.com/v1/partition-hook-multiset-inverse-familyEingaben
| Feld | Typ | Pflicht | Beschreibung |
|---|---|---|---|
| hooks | Siehe Schema | Ja | |
| claimed_shapes | Siehe Schema | Ja |
Vollständiges Eingabeschema anzeigen
{
"type": "object",
"additionalProperties": false,
"required": [
"hooks",
"claimed_shapes"
],
"properties": {
"hooks": {
"anyOf": [
{
"type": "array",
"maxItems": 20,
"items": {
"type": "integer",
"minimum": 1,
"maximum": 20
}
},
{
"type": "null"
}
]
},
"claimed_shapes": {
"anyOf": [
{
"type": "array",
"maxItems": 627,
"items": {
"type": "array",
"maxItems": 20,
"items": {
"type": "integer",
"minimum": 1,
"maximum": 20
}
}
},
{
"type": "null"
}
]
}
}
}Veröffentlichtes Eingabebeispiel
{
"hooks": [
1,
1,
1,
2,
2,
2,
3,
3,
4,
4,
5,
6,
8,
9
],
"claimed_shapes": [
[
4,
4,
3,
1,
1,
1
],
[
5,
3,
2,
2,
2
],
[
5,
5,
2,
1,
1
],
[
6,
3,
3,
2
]
]
}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