HALOWERKDatenvertragswerk
barycentric face chain subdivision
From1..25nonempty supplied generatorfaces of1..3distinct labels0..4,form the downwardclosed abstract simplicialcomplex,normalize redundant/duplicate generators,and construct its whole barycentric subdivision. Every nonempty sourceface becomes a vertex,numbered by face shortlex(lengththenlex). Return canonicalsourcefacets,complete facevertexmap,all nonempty strictly nested facechains as subdivided simplices,all maximalchainfacets,dimension and fvector(numberof0/1/2simplices,noemptyfaceentry)..
POST https://datenvertrag.halowerk.com/v1/barycentric-face-chain-subdivisionEingaben
| Feld | Typ | Pflicht | Beschreibung |
|---|---|---|---|
| facets | Siehe Schema | Ja | |
| claimed_value | Siehe Schema | Ja |
Vollständiges Eingabeschema anzeigen
{
"type": "object",
"properties": {
"facets": {
"anyOf": [
{
"type": "array",
"maxItems": 25,
"items": {
"type": "array",
"maxItems": 3,
"items": {
"type": "integer",
"minimum": 0,
"maximum": 4
},
"minItems": 1
},
"minItems": 1
},
{
"type": "null"
}
]
},
"claimed_value": {
"anyOf": [
{
"type": "object",
"properties": {
"source_facets": {
"type": "array",
"maxItems": 10,
"items": {
"type": "array",
"maxItems": 3,
"items": {
"type": "integer",
"minimum": 0,
"maximum": 4
},
"minItems": 1
}
},
"face_vertices": {
"type": "array",
"maxItems": 25,
"items": {
"type": "array",
"maxItems": 3,
"items": {
"type": "integer",
"minimum": 0,
"maximum": 4
},
"minItems": 1
}
},
"dimension": {
"type": "integer",
"minimum": 0,
"maximum": 2
},
"simplices": {
"type": "array",
"maxItems": 165,
"items": {
"type": "array",
"maxItems": 3,
"items": {
"type": "integer",
"minimum": 0,
"maximum": 24
},
"minItems": 1
}
},
"facets": {
"type": "array",
"maxItems": 60,
"items": {
"type": "array",
"maxItems": 3,
"items": {
"type": "integer",
"minimum": 0,
"maximum": 24
},
"minItems": 1
}
},
"f_vector": {
"type": "array",
"maxItems": 3,
"items": {
"type": "integer",
"minimum": 0,
"maximum": 165
},
"minItems": 3
}
},
"required": [
"source_facets",
"face_vertices",
"dimension",
"simplices",
"facets",
"f_vector"
],
"additionalProperties": false
},
{
"type": "null"
}
]
}
},
"required": [
"facets",
"claimed_value"
],
"additionalProperties": false
}Veröffentlichtes Eingabebeispiel
{
"facets": [
[
0,
1
]
],
"claimed_value": {
"source_facets": [
[
0,
1
]
],
"face_vertices": [
[
0
],
[
1
],
[
0,
1
]
],
"dimension": 1,
"simplices": [
[
0
],
[
1
],
[
2
],
[
0,
2
],
[
1,
2
]
],
"facets": [
[
0,
2
],
[
1,
2
]
],
"f_vector": [
3,
2,
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