Datenvertragswerk
finite associative algebra hochschild two cocycles
For an original associative unital Q-algebra ofdimension1..3 with identitybasis0 and complete integer structureconstants -1,0,1, construct its ENTIRE normalized Hochschild2cocycle/boundary spaces and HH2 quotient, and determine the actual second-order obstruction of a supplied normalized infinitesimal phi. Cochain order is lex inputindices1..n-1 then output0..n-1; phi isflat length n*(n-1)^2,coefficients -1,0,1. deltaf(a,b,c)=a*f(b,c)-f(a*b,c)+f(a,b*c)-f(a,b)*c. Return canonical row-RREF.
POST https://datenvertrag.halowerk.com/v1/finite-associative-algebra-hochschild-two-cocyclesInputs
| Field | Type | Required | Description |
|---|---|---|---|
| algebra | See schema | Yes | |
| infinitesimal | See schema | Yes | |
| claim | See schema | No |
Show full input schema
{
"type": "object",
"properties": {
"algebra": {
"anyOf": [
{
"type": "array",
"items": {
"type": "array",
"items": {
"type": "array",
"items": {
"type": "integer",
"minimum": -1,
"maximum": 1
},
"minItems": 1,
"maxItems": 3
},
"minItems": 1,
"maxItems": 3
},
"minItems": 1,
"maxItems": 3
},
{
"type": "null"
}
]
},
"infinitesimal": {
"anyOf": [
{
"type": "array",
"items": {
"type": "integer",
"minimum": -1,
"maximum": 1
},
"maxItems": 12
},
{
"type": "null"
}
]
},
"claim": {
"anyOf": [
{
"type": "string",
"pattern": "^[0-9a-f]{64}$",
"minLength": 64,
"maxLength": 64
},
{
"type": "null"
}
]
}
},
"required": [
"algebra",
"infinitesimal"
],
"additionalProperties": false
}Published input example
{
"algebra": [
[
[
1,
0
],
[
0,
1
]
],
[
[
0,
1
],
[
0,
1
]
]
],
"infinitesimal": [
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.