Datenvertragswerk
finite function centralizer family
For an original total function f on labels0..n-1,n1..4, construct ALL total functions g satisfying g[f[i]]=f[g[i]] for every original state i. Return whole maps in numeric lexicographic order, count, image_size_histogram indexed0..n including zero bins, and aligned idempotent_flags testing g[g[i]]=g[i] for every i. Include noninjective maps and preserve all state labels, with no graph-isomorphism quotient. Identity is always included. This reconstructs every state remapping compatible with a.
POST https://datenvertrag.halowerk.com/v1/finite-function-centralizer-familyInputs
| Field | Type | Required | Description |
|---|---|---|---|
| function | See schema | Yes | |
| claim | See schema | Yes |
Show full input schema
{
"type": "object",
"properties": {
"function": {
"anyOf": [
{
"type": "array",
"items": {
"type": "integer",
"minimum": 0,
"maximum": 3
},
"minItems": 1,
"maxItems": 4
},
{
"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": 1,
"maxItems": 256
},
"count": {
"type": "integer",
"minimum": 1,
"maximum": 256
},
"image_size_histogram": {
"type": "array",
"items": {
"type": "integer",
"minimum": 0,
"maximum": 256
},
"minItems": 2,
"maxItems": 5
},
"idempotent_flags": {
"type": "array",
"items": {
"type": "boolean"
},
"minItems": 1,
"maxItems": 256
}
},
"required": [
"maps",
"count",
"image_size_histogram",
"idempotent_flags"
],
"additionalProperties": false
},
{
"type": "null"
}
]
}
},
"required": [
"function",
"claim"
],
"additionalProperties": false
}Published input example
{
"function": [
0
],
"claim": {
"maps": [
[
0
]
],
"count": 1,
"image_size_histogram": [
0,
1
],
"idempotent_flags": [
true
]
}
}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.