HALOWERKDatenvertragswerk
integer partition index audit
For supplied total n0..24, counts all nonincreasing positive-integer partitions and reconstructs zero-based lexicographically descending index. Returns full chosen partition, its Ferrers conjugate and complete skipped/selected branch-count rank trace. n0 has one empty partition. Out-of-range known index is a known negative; null n/index/claim preserves unknown. Whole count and chosen-partition claim compared. Does not permute a fixed symbol multiset, sample partitions or infer empirical.
POST https://datenvertrag.halowerk.com/v1/integer-partition-index-auditEingaben
| Feld | Typ | Pflicht | Beschreibung |
|---|---|---|---|
| n | Siehe Schema | Ja | |
| index | Siehe Schema | Ja | |
| claimed | Siehe Schema | Ja |
Vollständiges Eingabeschema anzeigen
{
"type": "object",
"properties": {
"n": {
"anyOf": [
{
"type": "integer",
"minimum": 0,
"maximum": 24
},
{
"type": "null"
}
]
},
"index": {
"anyOf": [
{
"type": "integer",
"minimum": 0,
"maximum": 2000
},
{
"type": "null"
}
]
},
"claimed": {
"anyOf": [
{
"type": "object",
"properties": {
"partition": {
"type": "array",
"items": {
"type": "integer",
"minimum": 1,
"maximum": 24
},
"maxItems": 24
},
"partition_count": {
"type": "integer",
"minimum": 1,
"maximum": 2048
}
},
"required": [
"partition",
"partition_count"
],
"additionalProperties": false
},
{
"type": "null"
}
]
}
},
"required": [
"n",
"index",
"claimed"
],
"additionalProperties": false
}Veröffentlichtes Eingabebeispiel
{
"n": 4,
"index": 2,
"claimed": {
"partition": [
2,
2
],
"partition_count": 5
}
}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