HALOWERKDatenvertragswerk
planar lattice cone hilbert basis
From two original primitive integer rays left/right with coordinates0..4 in the firstquadrant and positive determinant, construct the unique Hilbert basis: ALL nonzero latticepoints in their rational cone that cannot split as sum of two nonzero cone latticepoints. This whole minimal additive family generates EVERY integerpoint in the cone, including latticepoints outside the sublattice generated by the two boundaryrays. Return source determinant, all basisvectors ordered counterclockwise.
POST https://datenvertrag.halowerk.com/v1/planar-lattice-cone-hilbert-basisEingaben
| Feld | Typ | Pflicht | Beschreibung |
|---|---|---|---|
| left | Siehe Schema | Ja | |
| right | Siehe Schema | Ja | |
| claim | Siehe Schema | Ja |
Vollständiges Eingabeschema anzeigen
{
"$schema": "http://json-schema.org/draft-07/schema#",
"type": "object",
"additionalProperties": false,
"required": [
"left",
"right",
"claim"
],
"properties": {
"left": {
"anyOf": [
{
"type": "array",
"maxItems": 2,
"items": {
"type": "integer",
"minimum": 0,
"maximum": 4
},
"minItems": 2
},
{
"type": "null"
}
]
},
"right": {
"anyOf": [
{
"type": "array",
"maxItems": 2,
"items": {
"type": "integer",
"minimum": 0,
"maximum": 4
},
"minItems": 2
},
{
"type": "null"
}
]
},
"claim": {
"anyOf": [
{
"type": "array",
"maxItems": 32,
"items": {
"type": "array",
"maxItems": 2,
"items": {
"type": "integer",
"minimum": 0,
"maximum": 8
},
"minItems": 2
}
},
{
"type": "null"
}
]
}
}
}Veröffentlichtes Eingabebeispiel
{
"left": [
1,
0
],
"right": [
1,
2
],
"claim": [
[
1,
0
],
[
1,
1
],
[
1,
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