HALOWERKDatenvertragswerk
finite magma congruence family
For a fully captured closed binary operation table on 1..3 labelled elements, construct EVERY compatible equivalence relation and its whole quotient operation table; no associativity, commutativity or identity is assumed. Partitions are restricted-growth vectors sorted numeric lexicographically; blocks are ordered by their least element and members ascending. Quotient cell(i,j) is the block index of the product of least representatives. Return all partitions, all blocks, corresponding.
POST https://datenvertrag.halowerk.com/v1/finite-magma-congruence-familyEingaben
| Feld | Typ | Pflicht | Beschreibung |
|---|---|---|---|
| table | Siehe Schema | Ja | |
| claim | Siehe Schema | Ja |
Vollständiges Eingabeschema anzeigen
{
"$schema": "http://json-schema.org/draft-07/schema#",
"type": "object",
"additionalProperties": false,
"required": [
"table",
"claim"
],
"properties": {
"table": {
"anyOf": [
{
"type": "array",
"items": {
"type": "array",
"items": {
"type": "integer",
"minimum": 0,
"maximum": 2
},
"minItems": 1,
"maxItems": 3
},
"minItems": 1,
"maxItems": 3
},
{
"type": "null"
}
]
},
"claim": {
"anyOf": [
{
"type": "object",
"additionalProperties": false,
"required": [
"partitions",
"blocks",
"quotient_tables",
"refinement_matrix"
],
"properties": {
"partitions": {
"type": "array",
"items": {
"type": "array",
"items": {
"type": "integer",
"minimum": 0,
"maximum": 2
},
"minItems": 1,
"maxItems": 3
},
"minItems": 0,
"maxItems": 5
},
"blocks": {
"type": "array",
"items": {
"type": "array",
"items": {
"type": "array",
"items": {
"type": "integer",
"minimum": 0,
"maximum": 2
},
"minItems": 1,
"maxItems": 3
},
"minItems": 1,
"maxItems": 3
},
"minItems": 0,
"maxItems": 5
},
"quotient_tables": {
"type": "array",
"items": {
"type": "array",
"items": {
"type": "array",
"items": {
"type": "integer",
"minimum": 0,
"maximum": 2
},
"minItems": 1,
"maxItems": 3
},
"minItems": 1,
"maxItems": 3
},
"minItems": 0,
"maxItems": 5
},
"refinement_matrix": {
"type": "array",
"items": {
"type": "array",
"items": {
"type": "boolean"
},
"minItems": 1,
"maxItems": 5
},
"minItems": 0,
"maxItems": 5
}
}
},
{
"type": "null"
}
]
}
}
}Veröffentlichtes Eingabebeispiel
{
"table": [
[
0
]
],
"claim": {
"partitions": [
[
0
]
],
"blocks": [
[
[
0
]
]
],
"quotient_tables": [
[
[
0
]
]
],
"refinement_matrix": [
[
true
]
]
}
}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