HALOWERKDatenvertragswerk
partition core quotient ledger
For a nonincreasing positive integer partition of total0..12 and modulusr2..5, construct its whole r-core and ordered r-tuple of quotient partitions. Canonical convention pads beta numbers to the smallest multiple of r at least the number of rows, and labels runners by residues0..r-1. Return core/quotient sizes and removed r-hook count; size(original)=size(core)+r*sum(size(quotients)). Include empty partition and all empty quotient components. Whole core/quotient claim compared by fieldname.
POST https://datenvertrag.halowerk.com/v1/partition-core-quotient-ledgerEingaben
| Feld | Typ | Pflicht | Beschreibung |
|---|---|---|---|
| partition | Siehe Schema | Ja | |
| r | Siehe Schema | Ja | |
| claim | Siehe Schema | Ja |
Vollständiges Eingabeschema anzeigen
{
"$schema": "http://json-schema.org/draft-07/schema#",
"type": "object",
"additionalProperties": false,
"required": [
"partition",
"r",
"claim"
],
"properties": {
"partition": {
"anyOf": [
{
"type": "array",
"maxItems": 12,
"items": {
"type": "integer",
"minimum": 1,
"maximum": 12
}
},
{
"type": "null"
}
]
},
"r": {
"anyOf": [
{
"type": "integer",
"minimum": 2,
"maximum": 5
},
{
"type": "null"
}
]
},
"claim": {
"anyOf": [
{
"type": "object",
"additionalProperties": false,
"required": [
"core",
"quotient"
],
"properties": {
"core": {
"type": "array",
"maxItems": 12,
"items": {
"type": "integer",
"minimum": 1,
"maximum": 12
}
},
"quotient": {
"type": "array",
"maxItems": 5,
"items": {
"type": "array",
"maxItems": 12,
"items": {
"type": "integer",
"minimum": 1,
"maximum": 12
}
}
}
}
},
{
"type": "null"
}
]
}
}
}Veröffentlichtes Eingabebeispiel
{
"partition": [
4,
3,
1
],
"r": 3,
"claim": {
"core": [
2
],
"quotient": [
[
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