HALOWERKDatenvertragswerk
rooted tree admissible cut coproduct
For a complete rooted tree on1..5 original labels0..n-1, parents[0]=-1 and every other parent is an original label; every vertex must reach root0. Reconstruct the commutative nonplanar Connes-Kreimer coproduct Delta(T)=SUM coefficient*forest TENSOR trunk, with prunedFOREST on the LEFT and rootTRUNK on the RIGHT. An ordinary admissible edgecut contains at most one edge on any root-to-leaf path; include the emptycut and one additional totalcut above the root. Emptycut gives forest[]/trunk=T;.
POST https://datenvertrag.halowerk.com/v1/rooted-tree-admissible-cut-coproductEingaben
| Feld | Typ | Pflicht | Beschreibung |
|---|---|---|---|
| parents | Siehe Schema | Ja | |
| claim | Siehe Schema | Ja |
Vollständiges Eingabeschema anzeigen
{
"type": "object",
"properties": {
"parents": {
"anyOf": [
{
"type": "array",
"items": {
"type": "integer",
"minimum": -1,
"maximum": 4
},
"minItems": 1,
"maxItems": 5
},
{
"type": "null"
}
]
},
"claim": {
"anyOf": [
{
"type": "object",
"properties": {
"canonical_tree": {
"type": "string",
"minLength": 2,
"maxLength": 10
},
"terms": {
"type": "array",
"items": {
"type": "object",
"properties": {
"forest": {
"type": "array",
"items": {
"type": "string",
"minLength": 2,
"maxLength": 10
},
"minItems": 0,
"maxItems": 5
},
"trunk": {
"anyOf": [
{
"type": "string",
"minLength": 2,
"maxLength": 10
},
{
"type": "null"
}
]
},
"coefficient": {
"type": "integer",
"minimum": 1,
"maximum": 32
}
},
"required": [
"forest",
"trunk",
"coefficient"
],
"additionalProperties": false
},
"minItems": 2,
"maxItems": 32
}
},
"required": [
"canonical_tree",
"terms"
],
"additionalProperties": false
},
{
"type": "null"
}
]
}
},
"required": [
"parents",
"claim"
],
"additionalProperties": false
}Veröffentlichtes Eingabebeispiel
{
"parents": [
-1
],
"claim": {
"canonical_tree": "()",
"terms": [
{
"forest": [
"()"
],
"trunk": null,
"coefficient": 1
},
{
"forest": [],
"trunk": "()",
"coefficient": 1
}
]
}
}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