Datenvertragswerk
hochschild chain boundary
Compute the complete Hochschild boundary b_n of a supplied finite sparse tensor chain in C_n(A,A), for a finite associative algebra with ordered basis 0..d-1 over F_p. The structure constant multiplication[i][j][k] is the coefficient of e_k in e_i*e_j. Adjacent faces replace a_i,a_(i+1) by their product with sign (-1)^i; the last face is (-1)^n (a_n*a_0) tensor a_1 tensor . tensor a_(n-1). The cyclic product order matters for noncommutative algebras. Return the entire canonical sparse.
POST https://datenvertrag.halowerk.com/v1/hochschild-chain-boundaryInputs
| Field | Type | Required | Description |
|---|---|---|---|
| prime | integer | Yes | |
| multiplication | array | Yes | |
| degree | integer | Yes | |
| chain | array | Yes |
Show full input schema
{
"type": "object",
"properties": {
"prime": {
"type": "integer",
"minimum": 2,
"maximum": 97
},
"multiplication": {
"type": "array",
"minItems": 1,
"maxItems": 4,
"items": {
"type": "array",
"minItems": 1,
"maxItems": 4,
"items": {
"type": "array",
"minItems": 1,
"maxItems": 4,
"items": {
"type": "integer",
"minimum": 0,
"maximum": 96
}
}
}
},
"degree": {
"type": "integer",
"minimum": 0,
"maximum": 4
},
"chain": {
"type": "array",
"items": {
"type": "object",
"properties": {
"coefficient": {
"type": "integer",
"minimum": 0,
"maximum": 96
},
"basis": {
"type": "array",
"items": {
"type": "integer",
"minimum": 0,
"maximum": 3
},
"minItems": 1,
"maxItems": 5
}
},
"required": [
"coefficient",
"basis"
],
"additionalProperties": false
},
"maxItems": 64
}
},
"required": [
"prime",
"multiplication",
"degree",
"chain"
],
"additionalProperties": false
}Published input example
{
"prime": 5,
"multiplication": [
[
[
1
]
]
],
"degree": 2,
"chain": [
{
"coefficient": 3,
"basis": [
0,
0,
0
]
}
]
}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.