Datenvertragswerk
quandle cocycle braid state sum
Compute the quandle TWO-COCYCLE state-sum of the closure of one captured signed braid. table[x][y]=x*y is a finite RIGHT QUANDLE on labels0..n-1,n1..3: square/closed, each column bijective, x*x=x, (x*y)*z=(x*z)*(y*z). modulus is2or3; cocycle[x][y] is a residue0..modulus-1, same square shape, normalized phi(x,x)=0, satisfying phi(x,y)+phi(x*y,z)=phi(x,z)+phi(x*z,y*z) modulo modulus. On1..3 strands, a signed word of length0..2 uses ONE-based adjacent indices abs(g)<strands, applied LEFT TO.
POST https://datenvertrag.halowerk.com/v1/quandle-cocycle-braid-state-sumInputs
| Field | Type | Required | Description |
|---|---|---|---|
| table | See schema | Yes | |
| modulus | See schema | Yes | |
| cocycle | See schema | Yes | |
| strands | See schema | Yes | |
| word | See schema | Yes | |
| claim | See schema | Yes |
Show full input schema
{
"type": "object",
"properties": {
"table": {
"anyOf": [
{
"type": "array",
"items": {
"type": "array",
"items": {
"type": "integer",
"minimum": 0,
"maximum": 2
},
"minItems": 1,
"maxItems": 3
},
"minItems": 1,
"maxItems": 3
},
{
"type": "null"
}
]
},
"modulus": {
"anyOf": [
{
"enum": [
2,
3
]
},
{
"type": "null"
}
]
},
"cocycle": {
"anyOf": [
{
"type": "array",
"items": {
"type": "array",
"items": {
"type": "integer",
"minimum": 0,
"maximum": 2
},
"minItems": 1,
"maxItems": 3
},
"minItems": 1,
"maxItems": 3
},
{
"type": "null"
}
]
},
"strands": {
"anyOf": [
{
"type": "integer",
"minimum": 1,
"maximum": 3
},
{
"type": "null"
}
]
},
"word": {
"anyOf": [
{
"type": "array",
"items": {
"enum": [
-2,
-1,
1,
2
]
},
"minItems": 0,
"maxItems": 2
},
{
"type": "null"
}
]
},
"claim": {
"anyOf": [
{
"type": "object",
"properties": {
"colorings": {
"type": "array",
"items": {
"type": "array",
"items": {
"type": "integer",
"minimum": 0,
"maximum": 2
},
"minItems": 1,
"maxItems": 3
},
"minItems": 0,
"maxItems": 27
},
"weights": {
"type": "array",
"items": {
"type": "integer",
"minimum": 0,
"maximum": 2
},
"minItems": 0,
"maxItems": 27
},
"histogram": {
"type": "array",
"items": {
"type": "integer",
"minimum": 0,
"maximum": 27
},
"minItems": 2,
"maxItems": 3
},
"count": {
"type": "integer",
"minimum": 0,
"maximum": 27
}
},
"required": [
"colorings",
"weights",
"histogram",
"count"
],
"additionalProperties": false
},
{
"type": "null"
}
]
}
},
"required": [
"table",
"modulus",
"cocycle",
"strands",
"word",
"claim"
],
"additionalProperties": false
}Published input example
{
"table": [
[
0,
0
],
[
1,
1
]
],
"modulus": 2,
"cocycle": [
[
0,
1
],
[
0,
0
]
],
"strands": 2,
"word": [
1,
1
],
"claim": {
"colorings": [
[
0,
0
],
[
0,
1
],
[
1,
0
],
[
1,
1
]
],
"weights": [
0,
1,
1,
0
],
"histogram": [
2,
2
],
"count": 4
}
}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.