Datenvertragswerk
finite filtered simplicial persistent cup module
From a finite filtered 2-dimensional simplicial complex, compute the full degree2 image of H1 tensor H1 under the mod2 Alexander Whitney cup product at all three filtration stages, canonical ambient H2 quotient bases, complete cup-image bases and triangle cocycle representatives, every adjacent backwards restriction matrix and all six structure-map ranks. Positive-degree products exclude the unit. Sorted original vertex labels, face-closed explicit simplices with monotone births0..2; at.
POST https://datenvertrag.halowerk.com/v1/finite-filtered-simplicial-persistent-cup-moduleInputs
| Field | Type | Required | Description |
|---|---|---|---|
| simplices | See schema | Yes | |
| claim | See schema | Yes |
Show full input schema
{
"type": "object",
"additionalProperties": false,
"required": [
"simplices",
"claim"
],
"properties": {
"simplices": {
"anyOf": [
{
"type": "array",
"minItems": 1,
"maxItems": 128,
"items": {
"type": "object",
"additionalProperties": false,
"required": [
"vertices",
"birth"
],
"properties": {
"vertices": {
"type": "array",
"minItems": 1,
"maxItems": 3,
"uniqueItems": true,
"items": {
"type": "integer",
"minimum": 0,
"maximum": 31
}
},
"birth": {
"type": "integer",
"minimum": 0,
"maximum": 2
}
}
}
},
{
"type": "null"
}
]
},
"claim": {
"anyOf": [
{
"type": "object",
"additionalProperties": false,
"required": [
"stages",
"restriction_maps",
"rank_invariant"
],
"properties": {
"stages": {
"type": "array",
"minItems": 3,
"maxItems": 3,
"items": {
"type": "object",
"additionalProperties": false,
"required": [
"index",
"triangles",
"ambient_h2_basis",
"cup_basis",
"cup_representatives"
],
"properties": {
"index": {
"type": "integer",
"minimum": 0,
"maximum": 2
},
"triangles": {
"type": "array",
"maxItems": 36,
"items": {
"type": "array",
"minItems": 3,
"maxItems": 3,
"items": {
"type": "integer",
"minimum": 0,
"maximum": 31
}
}
},
"ambient_h2_basis": {
"type": "array",
"maxItems": 36,
"items": {
"type": "string",
"pattern": "^[01]*$",
"maxLength": 36
}
},
"cup_basis": {
"type": "array",
"maxItems": 36,
"items": {
"type": "string",
"pattern": "^[01]*$",
"maxLength": 36
}
},
"cup_representatives": {
"type": "array",
"maxItems": 36,
"items": {
"type": "string",
"pattern": "^[01]*$",
"maxLength": 36
}
}
}
}
},
"restriction_maps": {
"type": "array",
"minItems": 2,
"maxItems": 2,
"items": {
"type": "object",
"additionalProperties": false,
"required": [
"from",
"to",
"columns"
],
"properties": {
"from": {
"type": "integer",
"minimum": 1,
"maximum": 2
},
"to": {
"type": "integer",
"minimum": 0,
"maximum": 1
},
"columns": {
"type": "array",
"maxItems": 36,
"items": {
"type": "string",
"pattern": "^[01]*$",
"maxLength": 36
}
}
}
}
},
"rank_invariant": {
"type": "array",
"minItems": 6,
"maxItems": 6,
"items": {
"type": "object",
"additionalProperties": false,
"required": [
"from",
"to",
"rank"
],
"properties": {
"from": {
"type": "integer",
"minimum": 0,
"maximum": 2
},
"to": {
"type": "integer",
"minimum": 0,
"maximum": 2
},
"rank": {
"type": "integer",
"minimum": 0,
"maximum": 36
}
}
}
}
}
},
{
"type": "null"
}
]
}
}
}Published input example
{
"simplices": [
{
"vertices": [
0
],
"birth": 0
},
{
"vertices": [
1
],
"birth": 0
},
{
"vertices": [
2
],
"birth": 0
},
{
"vertices": [
3
],
"birth": 0
},
{
"vertices": [
4
],
"birth": 0
},
{
"vertices": [
5
],
"birth": 0
},
{
"vertices": [
6
],
"birth": 0
},
{
"vertices": [
7
],
"birth": 0
},
{
"vertices": [
8
],
"birth": 0
},
{
"vertices": [
9
],
"birth": 0
},
{
"vertices": [
10
],
"birth": 0
},
{
"vertices": [
11
],
"birth": 0
},
{
"vertices": [
12
],
"birth": 0
},
{
"vertices": [
13
],
"birth": 0
},
{
"vertices": [
14
],
"birth": 0
},
{
"vertices": [
0,
1
],
"birth": 0
},
{
"vertices": [
0,
2
],
"birth": 0
},
{
"vertices": [
0,
3
],
"birth": 0
},
{
"vertices": [
0,
4
],
"birth": 0
},
{
"vertices": [
0,
5
],
"birth": 0
},
{
"vertices": [
0,
6
],
"birth": 0
},
{
"vertices": [
0,
7
],
"birth": 0
},
{
"vertices": [
0,
8
],
"birth": 0
},
{
"vertices": [
0,
9
],
"birth": 0
},
{
"vertices": [
0,
10
],
"birth": 0
},
{
"vertices": [
0,
11
],
"birth": 0
},
{
"vertices": [
0,
12
],
"birth": 0
},
{
"vertices": [
0,
13
],
"birth": 0
},
{
"vertices": [
0,
14
],
"birth": 0
},
{
"vertices": [
1,
2
],
"birth": 0
},
{
"vertices": [
1,
3
],
"birth": 0
},
{
"vertices": [
2,
3
],
"birth": 0
},
{
"vertices": [
4,
5
],
"birth": 0
},
{
"vertices": [
4,
6
],
"birth": 0
},
{
"vertices": [
5,
6
],
"birth": 0
},
{
"vertices": [
7,
8
],
"birth": 0
},
{
"vertices": [
9,
10
],
"birth": 0
},
{
"vertices": [
11,
12
],
"birth": 0
},
{
"vertices": [
13,
14
],
"birth": 0
},
{
"vertices": [
0,
1,
2
],
"birth": 1
},
{
"vertices": [
0,
1,
3
],
"birth": 1
},
{
"vertices": [
0,
2,
3
],
"birth": 1
},
{
"vertices": [
0,
4,
5
],
"birth": 1
},
{
"vertices": [
0,
4,
6
],
"birth": 1
},
{
"vertices": [
0,
5,
6
],
"birth": 1
},
{
"vertices": [
1,
2,
3
],
"birth": 1
},
{
"vertices": [
4,
5,
6
],
"birth": 1
}
],
"claim": null
}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.