HALOWERKDatenvertragswerk
finite metric tight span complex
For an original1..4point metricmatrix withzerodiagonal,symmetricpositive offdiagonalintegers1..3 andtriangleinequalities(equalityallowed), construct the WHOLEtightspan: every nonemptyboundedface of P={f_i>=0,f_i+f_j>=d_ij}. Diagonalconditionsareincluded. Verticesarehalfintegral: return lexicographicsortedvertices_twice=2f(exactintegerhalf-unitcoordinates), everyface asascendingvertexindices inshortlex(lengththenlex), correspondingdimensions, indicesofALLinclusionmaximalfaces.
POST https://datenvertrag.halowerk.com/v1/finite-metric-tight-span-complexEingaben
| Feld | Typ | Pflicht | Beschreibung |
|---|---|---|---|
| metric | Siehe Schema | Ja | |
| claim | Siehe Schema | Ja |
Vollständiges Eingabeschema anzeigen
{
"$schema": "http://json-schema.org/draft-07/schema#",
"type": "object",
"additionalProperties": false,
"required": [
"metric",
"claim"
],
"properties": {
"metric": {
"anyOf": [
{
"type": "array",
"maxItems": 4,
"items": {
"type": "array",
"maxItems": 4,
"items": {
"type": "integer",
"minimum": 0,
"maximum": 3
},
"minItems": 1
},
"minItems": 1
},
{
"type": "null"
}
]
},
"claim": {
"anyOf": [
{
"type": "object",
"additionalProperties": false,
"required": [
"vertices_twice",
"faces",
"dimensions",
"maximal_faces",
"embedding_vertices"
],
"properties": {
"vertices_twice": {
"type": "array",
"maxItems": 16,
"items": {
"type": "array",
"maxItems": 4,
"items": {
"type": "integer",
"minimum": 0,
"maximum": 6
},
"minItems": 1
}
},
"faces": {
"type": "array",
"maxItems": 128,
"items": {
"type": "array",
"maxItems": 16,
"items": {
"type": "integer",
"minimum": 0,
"maximum": 15
},
"minItems": 1
}
},
"dimensions": {
"type": "array",
"maxItems": 128,
"items": {
"type": "integer",
"minimum": 0,
"maximum": 4
}
},
"maximal_faces": {
"type": "array",
"maxItems": 128,
"items": {
"type": "integer",
"minimum": 0,
"maximum": 127
}
},
"embedding_vertices": {
"type": "array",
"maxItems": 4,
"items": {
"type": "integer",
"minimum": 0,
"maximum": 15
}
}
}
},
{
"type": "null"
}
]
}
}
}Veröffentlichtes Eingabebeispiel
{
"metric": [
[
0,
1,
1
],
[
1,
0,
1
],
[
1,
1,
0
]
],
"claim": {
"vertices_twice": [
[
0,
2,
2
],
[
1,
1,
1
],
[
2,
0,
2
],
[
2,
2,
0
]
],
"faces": [
[
0
],
[
1
],
[
2
],
[
3
],
[
0,
1
],
[
1,
2
],
[
1,
3
]
],
"dimensions": [
0,
0,
0,
0,
1,
1,
1
],
"maximal_faces": [
4,
5,
6
],
"embedding_vertices": [
0,
2,
3
]
}
}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