Datenvertragswerk
finite group homomorphism family
For two finite group multiplication tables, source and target, each of order 1..4 with identity 0 and given as flat row-major n*n entries 0..n-1, finds every homomorphism f: source -> target with f[source[a,b]]=target[f[a],f[b]] for every a,b. Returns all maps in numeric lexicographic order, aligned kernel_masks and image_masks, and count. Non-injective, non-surjective and trivial maps are kept; no quotient by conjugation or isomorphism.
POST https://datenvertrag.halowerk.com/v1/finite-group-homomorphism-familyInputs
| Field | Type | Required | Description |
|---|---|---|---|
| source | See schema | Yes | |
| target | See schema | Yes | |
| claim | See schema | Yes |
Show full input schema
{
"type": "object",
"properties": {
"source": {
"anyOf": [
{
"type": "array",
"items": {
"type": "integer",
"minimum": 0,
"maximum": 3
},
"minItems": 1,
"maxItems": 16
},
{
"type": "null"
}
]
},
"target": {
"anyOf": [
{
"type": "array",
"items": {
"type": "integer",
"minimum": 0,
"maximum": 3
},
"minItems": 1,
"maxItems": 16
},
{
"type": "null"
}
]
},
"claim": {
"anyOf": [
{
"type": "object",
"properties": {
"maps": {
"type": "array",
"items": {
"type": "array",
"items": {
"type": "integer",
"minimum": 0,
"maximum": 3
},
"minItems": 1,
"maxItems": 4
},
"minItems": 0,
"maxItems": 16
},
"kernel_masks": {
"type": "array",
"items": {
"type": "integer",
"minimum": 1,
"maximum": 15
},
"minItems": 0,
"maxItems": 16
},
"image_masks": {
"type": "array",
"items": {
"type": "integer",
"minimum": 1,
"maximum": 15
},
"minItems": 0,
"maxItems": 16
},
"count": {
"type": "integer",
"minimum": 0,
"maximum": 17
}
},
"required": [
"maps",
"kernel_masks",
"image_masks",
"count"
],
"additionalProperties": false
},
{
"type": "null"
}
]
}
},
"required": [
"source",
"target",
"claim"
],
"additionalProperties": false
}Published input example
{
"source": [
0
],
"target": [
0
],
"claim": {
"maps": [
[
0
]
],
"kernel_masks": [
1
],
"image_masks": [
1
],
"count": 1
}
}Result & documentation
Machine-readable documentation of this hub
Source of this page: the published HALOWERK catalog. Updated: 2026-11-17 UTC.
More endpoints in this hub
- Datenvertragswerk0.003 USDC
acyclic automata probabilistic refinement witness
POSThttps://datenvertrag.halowerk.com/v1/acyclic-automata-probabilistic-refinement-witnessFor two finite action-labelled nondeterministic probabilistic automata return the WHOLE greatest DIRECTED STRONG SIMULATION relation, canonical single-transition matching couplings and exhaustive local negative Hall obstructions. Each of 1.
- Datenvertragswerk0.003 USDC
adjacency cospectral graph family
POSThttps://datenvertrag.halowerk.com/v1/adjacency-cospectral-graph-familyGiven n in 1..5 and a monic degree-n integer polynomial det(xI-A), returns every labelled simple undirected graph on vertices 0..n-1 with exactly that adjacency characteristic polynomial. Coefficients are in descending degree order, n+1 ent
- 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.