Datenvertragswerk
integer chain bockstein homomorphism
From a free integer chain complex C2->C1->C0, compute beta:H_k(C modp)->H_(k-1)(C modp) for the coefficient sequence0->Z/p --timesp-->Z/p²->Z/p->0. ranks names[C0,C1,C2], each0..4; d1 has ranks[0]rows/ranks[1]columns, d2 has ranks[1]rows/ranks[2]columns, integer entries-64..64, d1*d2=0 over integers. degree k1or2; prime2,3or5. Lift a modpcycle to its least nonnegative integer coordinates, take the integer boundary divided byp and reduce modp modulo target boundaries. Return explicit cycle,.
POST https://datenvertrag.halowerk.com/v1/integer-chain-bockstein-homomorphismInputs
| Field | Type | Required | Description |
|---|---|---|---|
| prime | See schema | Yes | |
| ranks | See schema | Yes | |
| d1 | See schema | Yes | |
| d2 | See schema | Yes | |
| degree | See schema | Yes | |
| claim | See schema | Yes |
Show full input schema
{
"type": "object",
"properties": {
"prime": {
"anyOf": [
{
"enum": [
2,
3,
5
]
},
{
"type": "null"
}
]
},
"ranks": {
"anyOf": [
{
"type": "array",
"items": {
"type": "integer",
"minimum": 0,
"maximum": 4
},
"minItems": 3,
"maxItems": 3
},
{
"type": "null"
}
]
},
"d1": {
"anyOf": [
{
"type": "array",
"items": {
"type": "array",
"items": {
"type": "integer",
"minimum": -64,
"maximum": 64
},
"minItems": 0,
"maxItems": 4
},
"minItems": 0,
"maxItems": 4
},
{
"type": "null"
}
]
},
"d2": {
"anyOf": [
{
"type": "array",
"items": {
"type": "array",
"items": {
"type": "integer",
"minimum": -64,
"maximum": 64
},
"minItems": 0,
"maxItems": 4
},
"minItems": 0,
"maxItems": 4
},
{
"type": "null"
}
]
},
"degree": {
"anyOf": [
{
"enum": [
1,
2
]
},
{
"type": "null"
}
]
},
"claim": {
"anyOf": [
{
"type": "object",
"properties": {
"source_cycles": {
"type": "array",
"items": {
"type": "array",
"items": {
"type": "integer",
"minimum": 0,
"maximum": 4
},
"minItems": 0,
"maxItems": 4
},
"minItems": 0,
"maxItems": 4
},
"source_boundaries": {
"type": "array",
"items": {
"type": "array",
"items": {
"type": "integer",
"minimum": 0,
"maximum": 4
},
"minItems": 0,
"maxItems": 4
},
"minItems": 0,
"maxItems": 4
},
"source_homology": {
"type": "array",
"items": {
"type": "array",
"items": {
"type": "integer",
"minimum": 0,
"maximum": 4
},
"minItems": 0,
"maxItems": 4
},
"minItems": 0,
"maxItems": 4
},
"target_cycles": {
"type": "array",
"items": {
"type": "array",
"items": {
"type": "integer",
"minimum": 0,
"maximum": 4
},
"minItems": 0,
"maxItems": 4
},
"minItems": 0,
"maxItems": 4
},
"target_boundaries": {
"type": "array",
"items": {
"type": "array",
"items": {
"type": "integer",
"minimum": 0,
"maximum": 4
},
"minItems": 0,
"maxItems": 4
},
"minItems": 0,
"maxItems": 4
},
"target_homology": {
"type": "array",
"items": {
"type": "array",
"items": {
"type": "integer",
"minimum": 0,
"maximum": 4
},
"minItems": 0,
"maxItems": 4
},
"minItems": 0,
"maxItems": 4
},
"divided_boundaries": {
"type": "array",
"maxItems": 4,
"items": {
"type": "array",
"maxItems": 4,
"items": {
"type": "integer",
"minimum": -512,
"maximum": 512
}
}
},
"image_cycles": {
"type": "array",
"items": {
"type": "array",
"items": {
"type": "integer",
"minimum": 0,
"maximum": 4
},
"minItems": 0,
"maxItems": 4
},
"minItems": 0,
"maxItems": 4
},
"matrix": {
"type": "array",
"items": {
"type": "array",
"items": {
"type": "integer",
"minimum": 0,
"maximum": 4
},
"minItems": 0,
"maxItems": 4
},
"minItems": 0,
"maxItems": 4
},
"rank": {
"type": "integer",
"minimum": 0,
"maximum": 4
}
},
"required": [
"source_cycles",
"source_boundaries",
"source_homology",
"target_cycles",
"target_boundaries",
"target_homology",
"divided_boundaries",
"image_cycles",
"matrix",
"rank"
],
"additionalProperties": false
},
{
"type": "null"
}
]
}
},
"required": [
"prime",
"ranks",
"d1",
"d2",
"degree",
"claim"
],
"additionalProperties": false
}Published input example
{
"prime": 2,
"ranks": [
1,
1,
0
],
"d1": [
[
2
]
],
"d2": [
[]
],
"degree": 1,
"claim": {
"source_cycles": [
[
1
]
],
"source_boundaries": [],
"source_homology": [
[
1
]
],
"target_cycles": [
[
1
]
],
"target_boundaries": [],
"target_homology": [
[
1
]
],
"divided_boundaries": [
[
1
]
],
"image_cycles": [
[
1
]
],
"matrix": [
[
1
]
],
"rank": 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.