Datenvertragswerk
rational group algebra wedderburn witness
Given a complete group multiplication table, construct the actual Wedderburn decomposition of its rational group algebra: simple cyclotomic fields, rational matrix blocks or the Hamilton division algebra, together with full forward and inverse rational maps, target multiplication constants and identity coordinates. Original group labels are retained, identity is0 and order is1 through8. A quaternion division block is distinguished from a split2x2 rational matrix block. The supplied whole.
POST https://datenvertrag.halowerk.com/v1/rational-group-algebra-wedderburn-witnessInputs
| Field | Type | Required | Description |
|---|---|---|---|
| table | See schema | Yes | |
| claim | See schema | Yes |
Show full input schema
{
"type": "object",
"properties": {
"table": {
"anyOf": [
{
"type": "null"
},
{
"type": "array",
"items": {
"type": "array",
"items": {
"type": "integer",
"minimum": 0,
"maximum": 7
},
"minItems": 1,
"maxItems": 8
},
"minItems": 1,
"maxItems": 8
}
]
},
"claim": {
"anyOf": [
{
"type": "null"
},
{
"type": "object",
"properties": {
"blocks": {
"type": "array",
"items": {
"type": "object",
"properties": {
"matrix_size": {
"type": "integer",
"minimum": 1,
"maximum": 2
},
"division": {
"type": "string",
"enum": [
"Q",
"Q(zeta3)",
"Q(zeta4)",
"Q(zeta5)",
"Q(zeta6)",
"Q(zeta7)",
"Q(zeta8)",
"Hamilton(-1,-1;Q)"
]
},
"center_polynomial": {
"type": "array",
"items": {
"type": "integer",
"minimum": -1,
"maximum": 1
},
"minItems": 2,
"maxItems": 7
},
"division_dimension_over_center": {
"type": "integer",
"enum": [
1,
4
]
},
"Schur_index": {
"type": "integer",
"enum": [
1,
2
]
}
},
"required": [
"matrix_size",
"division",
"center_polynomial",
"division_dimension_over_center"
],
"additionalProperties": false
},
"minItems": 1,
"maxItems": 8
},
"forward_target_rows_original_columns": {
"type": "array",
"items": {
"type": "array",
"items": {
"anyOf": [
{
"type": "integer",
"minimum": -4096,
"maximum": 4096
},
{
"type": "string",
"minLength": 1,
"maxLength": 16,
"pattern": "^-?(0|[1-9][0-9]*)(/[1-9][0-9]*)?$"
}
]
},
"minItems": 1,
"maxItems": 8
},
"minItems": 1,
"maxItems": 8
},
"inverse_original_rows_target_columns": {
"type": "array",
"items": {
"type": "array",
"items": {
"anyOf": [
{
"type": "integer",
"minimum": -4096,
"maximum": 4096
},
{
"type": "string",
"minLength": 1,
"maxLength": 16,
"pattern": "^-?(0|[1-9][0-9]*)(/[1-9][0-9]*)?$"
}
]
},
"minItems": 1,
"maxItems": 8
},
"minItems": 1,
"maxItems": 8
},
"target_multiplication_constants": {
"type": "array",
"items": {
"type": "array",
"items": {
"type": "array",
"items": {
"anyOf": [
{
"type": "integer",
"minimum": -4096,
"maximum": 4096
},
{
"type": "string",
"minLength": 1,
"maxLength": 16,
"pattern": "^-?(0|[1-9][0-9]*)(/[1-9][0-9]*)?$"
}
]
},
"minItems": 1,
"maxItems": 8
},
"minItems": 1,
"maxItems": 8
},
"minItems": 1,
"maxItems": 8
},
"identity_coordinates": {
"type": "array",
"items": {
"anyOf": [
{
"type": "integer",
"minimum": -4096,
"maximum": 4096
},
{
"type": "string",
"minLength": 1,
"maxLength": 16,
"pattern": "^-?(0|[1-9][0-9]*)(/[1-9][0-9]*)?$"
}
]
},
"minItems": 1,
"maxItems": 8
},
"dimension": {
"type": "integer",
"minimum": 1,
"maximum": 8
}
},
"required": [
"blocks",
"forward_target_rows_original_columns",
"inverse_original_rows_target_columns",
"target_multiplication_constants",
"identity_coordinates",
"dimension"
],
"additionalProperties": false
}
]
}
},
"required": [
"table",
"claim"
],
"additionalProperties": false
}Published input example
{
"table": [
[
0,
1,
2
],
[
1,
2,
0
],
[
2,
0,
1
]
],
"claim": null
}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.