Datenvertragswerk
finite group integral schur multiplier
Computes the entire integral second homology H_2(G,Z), the Schur multiplier, of one finite group given as a Cayley table of order 1..9 with identity 0. Returns its canonical invariant factors d1|.|dr (each >1), the exact order and exponent, and the ranks of the normalized integral bar-chain groups C1, C2, C3 and of the integer boundary maps over Q. H2 is given by the torsion Smith factors of d3; no lookup or mod-prime approximation.
POST https://datenvertrag.halowerk.com/v1/finite-group-integral-schur-multiplierInputs
| Field | Type | Required | Description |
|---|---|---|---|
| table | See schema | Yes | |
| claim | See schema | Yes |
Show full input schema
{
"type": "object",
"properties": {
"table": {
"anyOf": [
{
"type": "array",
"items": {
"type": "array",
"items": {
"type": "integer",
"minimum": 0,
"maximum": 8
},
"minItems": 1,
"maxItems": 9
},
"minItems": 1,
"maxItems": 9
},
{
"type": "null"
}
]
},
"claim": {
"anyOf": [
{
"type": "object",
"properties": {
"invariant_factors": {
"type": "array",
"items": {
"type": "integer",
"minimum": 2,
"maximum": 9
},
"minItems": 0,
"maxItems": 64
},
"order": {
"type": "string",
"pattern": "^[1-9][0-9]*$",
"maxLength": 62
},
"exponent": {
"type": "integer",
"minimum": 1,
"maximum": 9
},
"normalized_bar_chain_ranks": {
"type": "array",
"items": {
"type": "integer",
"minimum": 0,
"maximum": 512
},
"minItems": 3,
"maxItems": 3
},
"boundary_ranks_over_Q": {
"type": "array",
"items": {
"type": "integer",
"minimum": 0,
"maximum": 64
},
"minItems": 2,
"maxItems": 2
}
},
"required": [
"invariant_factors",
"order",
"exponent",
"normalized_bar_chain_ranks",
"boundary_ranks_over_Q"
],
"additionalProperties": false
},
{
"type": "null"
}
]
}
},
"required": [
"table",
"claim"
],
"additionalProperties": false
}Published input example
{
"table": [
[
0,
1,
2,
3
],
[
1,
0,
3,
2
],
[
2,
3,
0,
1
],
[
3,
2,
1,
0
]
],
"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.