HALOWERKDatenvertragswerk
christoffel boundary path ledger
For coprime east/north counts from1to8 with total at most12, reconstruct the lower and upper Christoffel words of slope north/east. Symbol0 moves east,1 moves north. Return both whole words and all vertices including endpoints, each with signed line_cross=east*y-north*x. Lower stays at/below the diagonal and is the lexicographically greatest such monotone word; upper is the least word at/above it. No actual coordinates, units, drawing accuracy or wave-stiffness tensor. Compare the whole.
POST https://datenvertrag.halowerk.com/v1/christoffel-boundary-path-ledgerEingaben
| Feld | Typ | Pflicht | Beschreibung |
|---|---|---|---|
| east | Siehe Schema | Ja | |
| north | Siehe Schema | Ja | |
| claimed_words | Siehe Schema | Ja |
Vollständiges Eingabeschema anzeigen
{
"$schema": "http://json-schema.org/draft-07/schema#",
"type": "object",
"additionalProperties": false,
"required": [
"east",
"north",
"claimed_words"
],
"properties": {
"east": {
"anyOf": [
{
"type": "integer",
"minimum": 1,
"maximum": 8
},
{
"type": "null"
}
]
},
"north": {
"anyOf": [
{
"type": "integer",
"minimum": 1,
"maximum": 8
},
{
"type": "null"
}
]
},
"claimed_words": {
"anyOf": [
{
"type": "object",
"additionalProperties": false,
"required": [
"lower",
"upper"
],
"properties": {
"lower": {
"type": "array",
"maxItems": 12,
"items": {
"type": "integer",
"minimum": 0,
"maximum": 1
}
},
"upper": {
"type": "array",
"maxItems": 12,
"items": {
"type": "integer",
"minimum": 0,
"maximum": 1
}
}
}
},
{
"type": "null"
}
]
}
}
}Veröffentlichtes Eingabebeispiel
{
"east": 7,
"north": 4,
"claimed_words": {
"lower": [
0,
0,
1,
0,
0,
1,
0,
0,
1,
0,
1
],
"upper": [
1,
0,
1,
0,
0,
1,
0,
0,
1,
0,
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