HALOWERKDatenvertragswerk
trace monoid foata normalization
Given original generator word and an explicit symmetric irreflexive independence relation, reconstruct its entire Cartier-Foata normal form, occurrence-indexed heights, all forward dependence edges and lexicographically least word in the adjacent-independent-swap class. Equal generators always depend. Each canonical layer is sorted and consists of mutually commuting distinct generators. Edges describe all dependent occurrence pairs, not a transitive reduction; heights are1-based and refer to.
POST https://datenvertrag.halowerk.com/v1/trace-monoid-foata-normalizationEingaben
| Feld | Typ | Pflicht | Beschreibung |
|---|---|---|---|
| alphabet | integer | Ja | |
| independence | Siehe Schema | Ja | |
| word | Siehe Schema | Ja | |
| claimed_layers | Siehe Schema | Ja |
Vollständiges Eingabeschema anzeigen
{
"type": "object",
"additionalProperties": false,
"required": [
"alphabet",
"independence",
"word",
"claimed_layers"
],
"properties": {
"alphabet": {
"type": "integer",
"minimum": 1,
"maximum": 4
},
"independence": {
"anyOf": [
{
"type": "array",
"maxItems": 6,
"items": {
"type": "array",
"minItems": 2,
"maxItems": 2,
"items": {
"type": "integer",
"minimum": 0,
"maximum": 3
}
}
},
{
"type": "null"
}
]
},
"word": {
"anyOf": [
{
"type": "array",
"maxItems": 8,
"items": {
"type": "integer",
"minimum": 0,
"maximum": 3
}
},
{
"type": "null"
}
]
},
"claimed_layers": {
"anyOf": [
{
"type": "array",
"maxItems": 8,
"items": {
"type": "array",
"minItems": 1,
"maxItems": 8,
"items": {
"type": "integer",
"minimum": 0,
"maximum": 3
}
}
},
{
"type": "null"
}
]
}
}
}Veröffentlichtes Eingabebeispiel
{
"alphabet": 4,
"independence": [
[
0,
3
],
[
1,
2
]
],
"word": [
1,
0,
3,
0,
2,
1
],
"claimed_layers": [
[
1
],
[
0,
3
],
[
0
],
[
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