HALOWERKDatenvertragswerk
positive row graver basis
Given ONE indexed positive integer weight row a of length1..3, each weight1..3, reconstruct its ENTIRE Graver basis: every nonzero integer vector z with sum(a[i]*z[i])=0 that has no distinct nonzero kernelvector u conformally below it (same coordinate signs and abs(u[i])<=abs(z[i]) for every i). Include BOTH signs of every primitive relation, not a one-sign representative set. Original coordinates remain indexed, including repeated weights; do not sort or deduplicate the source row. Sort.
POST https://datenvertrag.halowerk.com/v1/positive-row-graver-basisEingaben
| Feld | Typ | Pflicht | Beschreibung |
|---|---|---|---|
| weights | Siehe Schema | Ja | |
| claim | Siehe Schema | Ja |
Vollständiges Eingabeschema anzeigen
{
"type": "object",
"properties": {
"weights": {
"anyOf": [
{
"type": "array",
"items": {
"type": "integer",
"minimum": 1,
"maximum": 3
},
"minItems": 1,
"maxItems": 3
},
{
"type": "null"
}
]
},
"claim": {
"anyOf": [
{
"type": "object",
"properties": {
"moves": {
"type": "array",
"items": {
"type": "array",
"items": {
"type": "integer",
"minimum": -7,
"maximum": 7
},
"minItems": 1,
"maxItems": 3
},
"minItems": 0,
"maxItems": 64
},
"masses": {
"type": "array",
"items": {
"type": "integer",
"minimum": 0,
"maximum": 21
},
"minItems": 0,
"maxItems": 64
},
"l1_norms": {
"type": "array",
"items": {
"type": "integer",
"minimum": 0,
"maximum": 14
},
"minItems": 0,
"maxItems": 64
},
"count": {
"type": "integer",
"minimum": 0,
"maximum": 128
}
},
"required": [
"moves",
"masses",
"l1_norms",
"count"
],
"additionalProperties": false
},
{
"type": "null"
}
]
}
},
"required": [
"weights",
"claim"
],
"additionalProperties": false
}Veröffentlichtes Eingabebeispiel
{
"weights": [
1
],
"claim": {
"moves": [],
"masses": [],
"l1_norms": [],
"count": 0
}
}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