Datenvertragswerk
finite group hurwitz factorization orbit
For a complete group Cayley table oforder1..6 on original labels0..n-1(identity at ANYlabel) and factorization length0..3, return its ENTIRE labelled Hurwitz orbit under ALL braid words. Validate square closure, associativity on every triple, two-sided identity and two-sided inverse for every element; reject invalid tables or out-of-group tuple letters HTTP400 even with other null fields. Multiplication is table[a][b]=a*b, factors left-to-right. RIGHT action.
POST https://datenvertrag.halowerk.com/v1/finite-group-hurwitz-factorization-orbitInputs
| Field | Type | Required | Description |
|---|---|---|---|
| cayley_table | See schema | Yes | |
| factorization | See schema | Yes | |
| claim | See schema | Yes |
Show full input schema
{
"type": "object",
"properties": {
"cayley_table": {
"anyOf": [
{
"type": "array",
"items": {
"type": "array",
"items": {
"type": "integer",
"minimum": 0,
"maximum": 5
},
"minItems": 1,
"maxItems": 6
},
"minItems": 1,
"maxItems": 6
},
{
"type": "null"
}
]
},
"factorization": {
"anyOf": [
{
"type": "array",
"items": {
"type": "integer",
"minimum": 0,
"maximum": 5
},
"minItems": 0,
"maxItems": 3
},
{
"type": "null"
}
]
},
"claim": {
"anyOf": [
{
"type": "object",
"properties": {
"orbit": {
"type": "array",
"items": {
"type": "array",
"items": {
"type": "integer",
"minimum": 0,
"maximum": 5
},
"minItems": 0,
"maxItems": 3
},
"minItems": 1,
"maxItems": 216
},
"product": {
"type": "integer",
"minimum": 0,
"maximum": 5
},
"size": {
"type": "integer",
"minimum": 1,
"maximum": 216
},
"generator_order": {
"type": "array",
"items": {
"enum": [
1,
-1,
2,
-2
]
},
"minItems": 0,
"maxItems": 4
},
"transitions": {
"type": "array",
"items": {
"type": "array",
"items": {
"type": "integer",
"minimum": 0,
"maximum": 215
},
"minItems": 0,
"maxItems": 4
},
"minItems": 1,
"maxItems": 216
},
"witness_tree": {
"type": "array",
"items": {
"type": "array",
"items": {
"type": "integer",
"minimum": -2,
"maximum": 215
},
"minItems": 2,
"maxItems": 2
},
"minItems": 1,
"maxItems": 216
}
},
"required": [
"orbit",
"product",
"size",
"generator_order",
"transitions",
"witness_tree"
],
"additionalProperties": false
},
{
"type": "null"
}
]
}
},
"required": [
"cayley_table",
"factorization",
"claim"
],
"additionalProperties": false
}Published input example
{
"cayley_table": [
[
0,
1,
2
],
[
1,
2,
0
],
[
2,
0,
1
]
],
"factorization": [
1,
2
],
"claim": {
"orbit": [
[
1,
2
],
[
2,
1
]
],
"product": 0,
"size": 2,
"generator_order": [
1,
-1
],
"transitions": [
[
1,
1
],
[
0,
0
]
],
"witness_tree": [
[
-1,
0
],
[
0,
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.