Datenvertragswerk
finite semisimplicial alexander whitney diagonal
For a finite semisimplicial set given as faces[n][x][i] = d_i of n-cell x (n 0..3, each degree 0..8 cells, at least one 0-cell), requires d_i d_j=d_(j-1) d_i for all i<j and computes the Alexander-Whitney diagonal AW(x)=sum_(p=0..n) front_p(x) tensor back_(n-p)(x). Returns the complete ordered basis family with terms [p, left cell, q, right cell, coefficient] and both D_tensor AW and AW D. No degeneracy maps or geometric manifold assumption.
POST https://datenvertrag.halowerk.com/v1/finite-semisimplicial-alexander-whitney-diagonalInputs
| Field | Type | Required | Description |
|---|---|---|---|
| faces | See schema | Yes | |
| claim | See schema | Yes |
Show full input schema
{
"type": "object",
"properties": {
"faces": {
"anyOf": [
{
"type": "array",
"items": {
"type": "array",
"items": {
"type": "array",
"items": {
"type": "integer",
"minimum": 0,
"maximum": 7
},
"minItems": 0,
"maxItems": 4
},
"minItems": 0,
"maxItems": 8
},
"minItems": 1,
"maxItems": 4
},
{
"type": "null"
}
]
},
"claim": {
"anyOf": [
{
"type": "object",
"properties": {
"counts": {
"type": "array",
"items": {
"type": "integer",
"minimum": 0,
"maximum": 8
},
"minItems": 1,
"maxItems": 4
},
"full_diagonal": {
"type": "array",
"items": {
"type": "object",
"properties": {
"degree": {
"type": "integer",
"minimum": 0,
"maximum": 3
},
"simplex": {
"type": "integer",
"minimum": 0,
"maximum": 7
},
"AW": {
"type": "array",
"items": {
"type": "array",
"items": {
"type": "integer",
"minimum": -8,
"maximum": 8
},
"minItems": 5,
"maxItems": 5
},
"minItems": 1,
"maxItems": 4
},
"tensor_boundary_AW": {
"type": "array",
"items": {
"type": "array",
"items": {
"type": "integer",
"minimum": -8,
"maximum": 8
},
"minItems": 5,
"maxItems": 5
},
"minItems": 0,
"maxItems": 12
},
"AW_boundary": {
"type": "array",
"items": {
"type": "array",
"items": {
"type": "integer",
"minimum": -8,
"maximum": 8
},
"minItems": 5,
"maxItems": 5
},
"minItems": 0,
"maxItems": 12
},
"signed_residual": {
"type": "array",
"items": {
"type": "array",
"items": {
"type": "integer",
"minimum": -8,
"maximum": 8
},
"minItems": 5,
"maxItems": 5
},
"minItems": 0,
"maxItems": 0
}
},
"required": [
"degree",
"simplex",
"AW",
"tensor_boundary_AW",
"AW_boundary",
"signed_residual"
],
"additionalProperties": false
},
"minItems": 1,
"maxItems": 32
}
},
"required": [
"counts",
"full_diagonal"
],
"additionalProperties": false
},
{
"type": "null"
}
]
}
},
"required": [
"faces",
"claim"
],
"additionalProperties": false,
"$schema": "http://json-schema.org/draft-07/schema#"
}Published input example
{
"faces": [
[
[],
[],
[]
],
[
[
1,
0
],
[
2,
0
],
[
2,
1
]
],
[
[
2,
1,
0
]
]
],
"claim": {
"counts": [
3,
3,
1
],
"full_diagonal": [
{
"degree": 0,
"simplex": 0,
"AW": [
[
0,
0,
0,
0,
1
]
],
"tensor_boundary_AW": [],
"AW_boundary": [],
"signed_residual": []
},
{
"degree": 0,
"simplex": 1,
"AW": [
[
0,
1,
0,
1,
1
]
],
"tensor_boundary_AW": [],
"AW_boundary": [],
"signed_residual": []
},
{
"degree": 0,
"simplex": 2,
"AW": [
[
0,
2,
0,
2,
1
]
],
"tensor_boundary_AW": [],
"AW_boundary": [],
"signed_residual": []
},
{
"degree": 1,
"simplex": 0,
"AW": [
[
0,
0,
1,
0,
1
],
[
1,
0,
0,
1,
1
]
],
"tensor_boundary_AW": [
[
0,
0,
0,
0,
-1
],
[
0,
1,
0,
1,
1
]
],
"AW_boundary": [
[
0,
0,
0,
0,
-1
],
[
0,
1,
0,
1,
1
]
],
"signed_residual": []
},
{
"degree": 1,
"simplex": 1,
"AW": [
[
0,
0,
1,
1,
1
],
[
1,
1,
0,
2,
1
]
],
"tensor_boundary_AW": [
[
0,
0,
0,
0,
-1
],
[
0,
2,
0,
2,
1
]
],
"AW_boundary": [
[
0,
0,
0,
0,
-1
],
[
0,
2,
0,
2,
1
]
],
"signed_residual": []
},
{
"degree": 1,
"simplex": 2,
"AW": [
[
0,
1,
1,
2,
1
],
[
1,
2,
0,
2,
1
]
],
"tensor_boundary_AW": [
[
0,
1,
0,
1,
-1
],
[
0,
2,
0,
2,
1
]
],
"AW_boundary": [
[
0,
1,
0,
1,
-1
],
[
0,
2,
0,
2,
1
]
],
"signed_residual": []
},
{
"degree": 2,
"simplex": 0,
"AW": [
[
0,
0,
2,
0,
1
],
[
1,
0,
1,
2,
1
],
[
2,
0,
0,
2,
1
]
],
"tensor_boundary_AW": [
[
0,
0,
1,
0,
1
],
[
0,
0,
1,
1,
-1
],
[
0,
1,
1,
2,
1
],
[
1,
0,
0,
1,
1
],
[
1,
1,
0,
2,
-1
],
[
1,
2,
0,
2,
1
]
],
"AW_boundary": [
[
0,
0,
1,
0,
1
],
[
0,
0,
1,
1,
-1
],
[
0,
1,
1,
2,
1
],
[
1,
0,
0,
1,
1
],
[
1,
1,
0,
2,
-1
],
[
1,
2,
0,
2,
1
]
],
"signed_residual": []
}
]
}
}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.