Datenvertragswerk
finite dga triple massey product
Computes the complete triple Massey product of three supplied degree 1 cycles of a unital noncommutative F2 differential graded algebra. Returns every cohomology class, the canonical coset representative, all indeterminacy elements and their dimension, zero containment, pair-boundary flags, H1/H2 dimensions and the number of defining systems. Undefined is a known computed result. Domain: 1..48 basis elements, at most 6 degree 1 basis vectors and dim Z1<=3.
POST https://datenvertrag.halowerk.com/v1/finite-dga-triple-massey-productInputs
| Field | Type | Required | Description |
|---|---|---|---|
| dga | See schema | Yes | |
| degree | See schema | Yes | |
| a | string | Yes | |
| b | string | Yes | |
| c | string | Yes | |
| claim | See schema | Yes |
Show full input schema
{
"type": "object",
"properties": {
"dga": {
"anyOf": [
{
"type": "object",
"properties": {
"basis": {
"type": "array",
"items": {
"type": "string",
"maxLength": 8
},
"maxItems": 48
},
"degrees": {
"type": "array",
"items": {
"type": "integer",
"minimum": 0,
"maximum": 2
},
"maxItems": 48
},
"differential_columns": {
"type": "array",
"items": {
"type": "string",
"pattern": "^0x(?:0|[1-9a-f][0-9a-f]*)$",
"maxLength": 14
},
"maxItems": 48
},
"multiplication_columns": {
"type": "array",
"items": {
"type": "array",
"items": {
"type": "string",
"pattern": "^0x(?:0|[1-9a-f][0-9a-f]*)$",
"maxLength": 14
},
"maxItems": 48
},
"maxItems": 48
}
},
"required": [
"basis",
"degrees",
"differential_columns",
"multiplication_columns"
],
"additionalProperties": false
},
{
"type": "null"
}
]
},
"degree": {
"const": 1
},
"a": {
"type": "string",
"pattern": "^0x(?:0|[1-9a-f][0-9a-f]*)$",
"maxLength": 14
},
"b": {
"type": "string",
"pattern": "^0x(?:0|[1-9a-f][0-9a-f]*)$",
"maxLength": 14
},
"c": {
"type": "string",
"pattern": "^0x(?:0|[1-9a-f][0-9a-f]*)$",
"maxLength": 14
},
"claim": {
"anyOf": [
{
"type": "object",
"properties": {
"status": {
"enum": [
"defined",
"undefined"
]
},
"complete_classes": {
"type": "array",
"items": {
"type": "string",
"pattern": "^0x(?:0|[1-9a-f][0-9a-f]*)$",
"maxLength": 14
},
"maxItems": 64
},
"coset_representative": {
"anyOf": [
{
"type": "string",
"pattern": "^0x(?:0|[1-9a-f][0-9a-f]*)$",
"maxLength": 14
},
{
"type": "null"
}
]
},
"indeterminacy_elements": {
"type": "array",
"items": {
"type": "string",
"pattern": "^0x(?:0|[1-9a-f][0-9a-f]*)$",
"maxLength": 14
},
"maxItems": 64
},
"indeterminacy_dimension": {
"anyOf": [
{
"type": "integer",
"minimum": 0,
"maximum": 6
},
{
"type": "null"
}
]
},
"contains_zero": {
"type": [
"boolean",
"null"
]
},
"pair_products": {
"type": "object",
"properties": {
"ab": {
"type": "string",
"pattern": "^0x(?:0|[1-9a-f][0-9a-f]*)$",
"maxLength": 14
},
"bc": {
"type": "string",
"pattern": "^0x(?:0|[1-9a-f][0-9a-f]*)$",
"maxLength": 14
},
"ab_is_boundary": {
"type": "boolean"
},
"bc_is_boundary": {
"type": "boolean"
}
},
"required": [
"ab",
"bc",
"ab_is_boundary",
"bc_is_boundary"
],
"additionalProperties": false
},
"cohomology_H1_dimension": {
"type": "integer",
"minimum": 0,
"maximum": 3
},
"cohomology_H2_dimension": {
"type": "integer",
"minimum": 0,
"maximum": 47
},
"boundary_reduction": {
"type": "string"
},
"defined_system_count": {
"type": "integer",
"minimum": 0,
"maximum": 64
}
},
"required": [
"status",
"pair_products",
"cohomology_H1_dimension",
"cohomology_H2_dimension",
"boundary_reduction",
"defined_system_count",
"complete_classes",
"coset_representative",
"indeterminacy_elements",
"indeterminacy_dimension",
"contains_zero"
],
"additionalProperties": false
},
{
"type": "null"
}
]
}
},
"required": [
"dga",
"degree",
"a",
"b",
"c",
"claim"
],
"additionalProperties": false
}Published input example
{
"dga": {
"basis": [
"1",
"a",
"b",
"c",
"u",
"v",
"aa",
"ab",
"av",
"bc"
],
"degrees": [
0,
1,
1,
1,
1,
1,
2,
2,
2,
2
],
"differential_columns": [
"0x0",
"0x0",
"0x0",
"0x0",
"0x80",
"0x200",
"0x0",
"0x0",
"0x0",
"0x0"
],
"multiplication_columns": [
[
"0x1",
"0x2",
"0x4",
"0x8",
"0x10",
"0x20",
"0x40",
"0x80",
"0x100",
"0x200"
],
[
"0x2",
"0x40",
"0x80",
"0x0",
"0x0",
"0x100",
"0x0",
"0x0",
"0x0",
"0x0"
],
[
"0x4",
"0x0",
"0x0",
"0x200",
"0x0",
"0x0",
"0x0",
"0x0",
"0x0",
"0x0"
],
[
"0x8",
"0x0",
"0x0",
"0x0",
"0x0",
"0x0",
"0x0",
"0x0",
"0x0",
"0x0"
],
[
"0x10",
"0x0",
"0x0",
"0x0",
"0x0",
"0x0",
"0x0",
"0x0",
"0x0",
"0x0"
],
[
"0x20",
"0x0",
"0x0",
"0x0",
"0x0",
"0x0",
"0x0",
"0x0",
"0x0",
"0x0"
],
[
"0x40",
"0x0",
"0x0",
"0x0",
"0x0",
"0x0",
"0x0",
"0x0",
"0x0",
"0x0"
],
[
"0x80",
"0x0",
"0x0",
"0x0",
"0x0",
"0x0",
"0x0",
"0x0",
"0x0",
"0x0"
],
[
"0x100",
"0x0",
"0x0",
"0x0",
"0x0",
"0x0",
"0x0",
"0x0",
"0x0",
"0x0"
],
[
"0x200",
"0x0",
"0x0",
"0x0",
"0x0",
"0x0",
"0x0",
"0x0",
"0x0",
"0x0"
]
]
},
"degree": 1,
"a": "0x2",
"b": "0x4",
"c": "0x8",
"claim": {
"status": "defined",
"pair_products": {
"ab": "0x80",
"bc": "0x200",
"ab_is_boundary": true,
"bc_is_boundary": true
},
"cohomology_H1_dimension": 3,
"cohomology_H2_dimension": 2,
"boundary_reduction": "Least nonnegative full-DGA basis bitmask in cohomology class modulo degree2 boundaries.",
"defined_system_count": 64,
"complete_classes": [
"0x100",
"0x140"
],
"coset_representative": "0x100",
"indeterminacy_elements": [
"0x0",
"0x40"
],
"indeterminacy_dimension": 1,
"contains_zero": false
}
}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.