Datenvertragswerk
finite transformation semigroup holonomy skeleton
From n 1..3 states 0..n-1 and 0..3 total transformation generators, forms the generated monoid S1 (identity adjoined, right action (s*t)[x]=t[s[x]]) and the extended image skeleton: all X*s plus X and every singleton. Returns the entire Boolean matrix of P<=S Q (P subset Q*s for some s in S1), every mutual subduction class, and for every non-singleton skeleton subset P its tiles and the faithful permutation image on tiles of the setwise stabilizer {s:P*s=P}.
POST https://datenvertrag.halowerk.com/v1/finite-transformation-semigroup-holonomy-skeletonInputs
| Field | Type | Required | Description |
|---|---|---|---|
| degree | See schema | Yes | |
| generators | See schema | Yes | |
| claim | See schema | No |
Show full input schema
{
"type": "object",
"properties": {
"degree": {
"anyOf": [
{
"type": "integer",
"minimum": 1,
"maximum": 3
},
{
"type": "null"
}
]
},
"generators": {
"anyOf": [
{
"type": "array",
"items": {
"type": "array",
"items": {
"type": "integer",
"minimum": 0,
"maximum": 2
},
"minItems": 1,
"maxItems": 3
},
"minItems": 0,
"maxItems": 3
},
{
"type": "null"
}
]
},
"claim": {
"anyOf": [
{
"type": "object",
"properties": {
"transformations": {
"type": "array",
"items": {
"type": "array",
"items": {
"type": "integer",
"minimum": 0,
"maximum": 2
},
"minItems": 1,
"maxItems": 3
},
"minItems": 1,
"maxItems": 27
},
"skeleton_masks": {
"type": "array",
"items": {
"type": "integer",
"minimum": 1,
"maximum": 7
},
"minItems": 1,
"maxItems": 7
},
"subduction": {
"type": "array",
"items": {
"type": "array",
"items": {
"type": "boolean"
},
"minItems": 1,
"maxItems": 7
},
"minItems": 1,
"maxItems": 7
},
"subduction_classes": {
"type": "array",
"items": {
"type": "array",
"items": {
"type": "integer",
"minimum": 1,
"maximum": 7
},
"minItems": 1,
"maxItems": 7
},
"minItems": 1,
"maxItems": 7
},
"holonomy_groups": {
"type": "array",
"items": {
"type": "object",
"properties": {
"set_mask": {
"type": "integer",
"minimum": 1,
"maximum": 7
},
"tiles": {
"type": "array",
"items": {
"type": "integer",
"minimum": 1,
"maximum": 7
},
"minItems": 2,
"maxItems": 3
},
"permutations": {
"type": "array",
"items": {
"type": "array",
"items": {
"type": "integer",
"minimum": 0,
"maximum": 2
},
"minItems": 2,
"maxItems": 3
},
"minItems": 1,
"maxItems": 6
},
"action_witnesses": {
"type": "array",
"items": {
"type": "object",
"properties": {
"permutation": {
"type": "array",
"items": {
"type": "integer",
"minimum": 0,
"maximum": 2
},
"minItems": 2,
"maxItems": 3
},
"transformation": {
"type": "array",
"items": {
"type": "integer",
"minimum": 0,
"maximum": 2
},
"minItems": 1,
"maxItems": 3
}
},
"required": [
"permutation",
"transformation"
],
"additionalProperties": false
},
"minItems": 1,
"maxItems": 6
}
},
"required": [
"set_mask",
"tiles",
"permutations",
"action_witnesses"
],
"additionalProperties": false
},
"minItems": 0,
"maxItems": 4
},
"complete": {
"const": true
}
},
"required": [
"transformations",
"skeleton_masks",
"subduction",
"subduction_classes",
"holonomy_groups",
"complete"
],
"additionalProperties": false
},
{
"type": "null"
}
]
}
},
"required": [
"degree",
"generators"
],
"additionalProperties": false
}Published input example
{
"degree": 3,
"generators": [
[
1,
2,
0
]
]
}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.