Datenvertragswerk
based acyclic chain reidemeister torsion
Computes the Reidemeister torsion of a finite based acyclic rational chain complex C_m->.->C_0 with 2..5 degrees and dimensions 0..3; differential[i-1] is the row-major matrix d_i: C_i->C_(i-1). Requires exact d_i*d_(i+1)=0 and acyclicity at every degree; otherwise the result is 400 invalid_profile, not zero torsion. Returns every ordered M_i, boundary rank, determinant and exponent (-1)^(i+1), and tau = product det(M_i)^exponent in signed Q*, no absolute value.
POST https://datenvertrag.halowerk.com/v1/based-acyclic-chain-reidemeister-torsionInputs
| Field | Type | Required | Description |
|---|---|---|---|
| dimensions | See schema | Yes | |
| differentials | See schema | Yes | |
| claim_torsion | See schema | Yes |
Show full input schema
{
"type": "object",
"properties": {
"dimensions": {
"anyOf": [
{
"type": "array",
"items": {
"type": "integer",
"minimum": 0,
"maximum": 3
},
"minItems": 2,
"maxItems": 5
},
{
"type": "null"
}
]
},
"differentials": {
"anyOf": [
{
"type": "array",
"items": {
"type": "array",
"maxItems": 3,
"items": {
"type": "array",
"maxItems": 3,
"items": {
"type": "string",
"pattern": "^-?(0|[1-9][0-9]?)(/[1-9][0-9]?)?$",
"maxLength": 6
}
}
},
"minItems": 1,
"maxItems": 4
},
{
"type": "null"
}
]
},
"claim_torsion": {
"anyOf": [
{
"type": "string",
"pattern": "^-?(0|[1-9][0-9]{0,119})(/[1-9][0-9]{0,119})?$",
"maxLength": 242
},
{
"type": "null"
}
]
}
},
"required": [
"dimensions",
"differentials",
"claim_torsion"
],
"additionalProperties": false
}Published input example
{
"dimensions": [
1,
2,
1
],
"differentials": [
[
[
"2",
"0"
]
],
[
[
"0"
],
[
"3"
]
]
],
"claim_torsion": "-3/2"
}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.