Datenvertragswerk
finite group extension classification witness
Classify all extensions of a finite abelian module A by a quotient group G acting on A, up to fixed-end equivalence, and partition the classes by abstract isomorphism of the middle group. Returns the normalized 2-cocycle family with coboundaries, least-lex class representatives with twisted product tables, 1-cochain witnesses, canonical group tables and pairwise isomorphism witnesses or null. Profile 1<=|A|<=4, 1<=|G|<=3, |A||G|<=8; exact finite computation, fixed 0.003 USDC.
POST https://datenvertrag.halowerk.com/v1/finite-group-extension-classification-witnessInputs
| Field | Type | Required | Description |
|---|---|---|---|
| A_table | See schema | Yes | |
| G_table | See schema | Yes | |
| action | See schema | Yes | |
| cocycle | See schema | Yes | |
| claim | See schema | No |
Show full input schema
{
"type": "object",
"properties": {
"A_table": {
"anyOf": [
{
"type": "array",
"items": {
"type": "array",
"items": {
"enum": [
0,
1,
2,
3
]
},
"minItems": 1,
"maxItems": 4
},
"minItems": 1,
"maxItems": 4
},
{
"type": "null"
}
]
},
"G_table": {
"anyOf": [
{
"type": "array",
"items": {
"type": "array",
"items": {
"enum": [
0,
1,
2
]
},
"minItems": 1,
"maxItems": 3
},
"minItems": 1,
"maxItems": 3
},
{
"type": "null"
}
]
},
"action": {
"anyOf": [
{
"type": "array",
"items": {
"type": "array",
"items": {
"enum": [
0,
1,
2,
3
]
},
"minItems": 1,
"maxItems": 4
},
"minItems": 1,
"maxItems": 3
},
{
"type": "null"
}
]
},
"cocycle": {
"anyOf": [
{
"type": "array",
"items": {
"type": "array",
"items": {
"enum": [
0,
1,
2,
3
]
},
"minItems": 1,
"maxItems": 3
},
"minItems": 1,
"maxItems": 3
},
{
"type": "null"
}
]
},
"claim": {
"anyOf": [
{
"type": "object",
"properties": {
"valid_cocycles": {
"type": "array",
"items": {
"type": "array",
"items": {
"enum": [
0,
1,
2,
3
]
},
"minItems": 1,
"maxItems": 9
},
"minItems": 1,
"maxItems": 4
},
"coboundaries": {
"type": "array",
"items": {
"type": "object",
"properties": {
"cocycle": {
"type": "array",
"items": {
"enum": [
0,
1,
2,
3
]
},
"minItems": 1,
"maxItems": 9
},
"cochain": {
"type": "array",
"items": {
"enum": [
0,
1,
2,
3
]
},
"minItems": 1,
"maxItems": 3
}
},
"required": [
"cocycle",
"cochain"
],
"additionalProperties": false
},
"minItems": 1,
"maxItems": 4
},
"extension_classes": {
"type": "array",
"items": {
"type": "object",
"properties": {
"representative_cocycle": {
"type": "array",
"items": {
"enum": [
0,
1,
2,
3
]
},
"minItems": 1,
"maxItems": 9
},
"members": {
"type": "array",
"items": {
"type": "object",
"properties": {
"cocycle_index": {
"enum": [
0,
1,
2,
3
]
},
"cochain_to_representative": {
"type": "array",
"items": {
"enum": [
0,
1,
2,
3
]
},
"minItems": 1,
"maxItems": 3
},
"extension_map_to_representative": {
"type": "array",
"items": {
"enum": [
0,
1,
2,
3,
4,
5,
6,
7
]
},
"minItems": 1,
"maxItems": 8
}
},
"required": [
"cocycle_index",
"cochain_to_representative",
"extension_map_to_representative"
],
"additionalProperties": false
},
"minItems": 1,
"maxItems": 4
},
"group_table": {
"type": "array",
"items": {
"type": "array",
"items": {
"enum": [
0,
1,
2,
3,
4,
5,
6,
7
]
},
"minItems": 1,
"maxItems": 8
},
"minItems": 1,
"maxItems": 8
},
"canonical_group_table": {
"type": "array",
"items": {
"type": "array",
"items": {
"enum": [
0,
1,
2,
3,
4,
5,
6,
7
]
},
"minItems": 1,
"maxItems": 8
},
"minItems": 1,
"maxItems": 8
},
"canonicalizing_map": {
"type": "array",
"items": {
"enum": [
0,
1,
2,
3,
4,
5,
6,
7
]
},
"minItems": 1,
"maxItems": 8
}
},
"required": [
"representative_cocycle",
"members",
"group_table",
"canonical_group_table",
"canonicalizing_map"
],
"additionalProperties": false
},
"minItems": 1,
"maxItems": 4
},
"inclusion": {
"type": "array",
"items": {
"enum": [
0,
1,
2,
3,
4,
5,
6,
7
]
},
"minItems": 1,
"maxItems": 4
},
"projection": {
"type": "array",
"items": {
"enum": [
0,
1,
2
]
},
"minItems": 1,
"maxItems": 8
},
"abstract_isomorphism_partition": {
"type": "array",
"items": {
"type": "array",
"items": {
"enum": [
0,
1,
2,
3
]
},
"minItems": 1,
"maxItems": 4
},
"minItems": 1,
"maxItems": 4
},
"group_isomorphism_witnesses": {
"type": "array",
"items": {
"type": "array",
"items": {
"anyOf": [
{
"type": "array",
"items": {
"enum": [
0,
1,
2,
3,
4,
5,
6,
7
]
},
"minItems": 1,
"maxItems": 8
},
{
"type": "null"
}
]
},
"minItems": 1,
"maxItems": 4
},
"minItems": 1,
"maxItems": 4
},
"source_group_table": {
"type": "array",
"items": {
"type": "array",
"items": {
"enum": [
0,
1,
2,
3,
4,
5,
6,
7
]
},
"minItems": 1,
"maxItems": 8
},
"minItems": 1,
"maxItems": 8
},
"source_class": {
"enum": [
0,
1,
2,
3
]
},
"source_to_representative": {
"type": "array",
"items": {
"enum": [
0,
1,
2,
3,
4,
5,
6,
7
]
},
"minItems": 1,
"maxItems": 8
},
"complete": {
"type": "boolean"
}
},
"required": [
"valid_cocycles",
"coboundaries",
"extension_classes",
"inclusion",
"projection",
"abstract_isomorphism_partition",
"group_isomorphism_witnesses",
"source_group_table",
"source_class",
"source_to_representative",
"complete"
],
"additionalProperties": false
},
{
"type": "null"
}
]
}
},
"required": [
"A_table",
"G_table",
"action",
"cocycle"
],
"additionalProperties": false
}Published input example
{
"A_table": [
[
0,
1
],
[
1,
0
]
],
"G_table": [
[
0,
1,
2
],
[
1,
2,
0
],
[
2,
0,
1
]
],
"action": [
[
0,
1
],
[
0,
1
],
[
0,
1
]
],
"cocycle": [
[
0,
0,
0
],
[
0,
0,
1
],
[
0,
1,
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.