Datenvertragswerk
finite biquandle yang baxter cocycle space
Given two complete labelled tables R1 and R2 for an invertible finite biquandle switch R(x,y)=(R1(x,y),R2(x,y)), construct the entire type-I-normalized second Yang-Baxter cocycle space over F2 or F3. Return canonical kink pairs, remaining ordered pair coordinates, full cocycle and coboundary bases, representative quotient basis, dimensions and exact space cardinalities. Normalization is zero on R-fixed kink pairs, which need not be diagonal. The quotient is Z2_typeI/B2_YB. R1rows/R2columns.
POST https://datenvertrag.halowerk.com/v1/finite-biquandle-yang-baxter-cocycle-spaceInputs
| Field | Type | Required | Description |
|---|---|---|---|
| R1 | See schema | Yes | |
| R2 | See schema | Yes | |
| p | See schema | Yes | |
| claim | See schema | Yes |
Show full input schema
{
"type": "object",
"additionalProperties": false,
"required": [
"R1",
"R2",
"p",
"claim"
],
"properties": {
"R1": {
"anyOf": [
{
"type": "array",
"minItems": 1,
"maxItems": 3,
"items": {
"type": "array",
"minItems": 1,
"maxItems": 3,
"items": {
"type": "integer",
"minimum": 0,
"maximum": 2
}
}
},
{
"type": "null"
}
]
},
"R2": {
"anyOf": [
{
"type": "array",
"minItems": 1,
"maxItems": 3,
"items": {
"type": "array",
"minItems": 1,
"maxItems": 3,
"items": {
"type": "integer",
"minimum": 0,
"maximum": 2
}
}
},
{
"type": "null"
}
]
},
"p": {
"anyOf": [
{
"type": "integer",
"enum": [
2,
3
]
},
{
"type": "null"
}
]
},
"claim": {
"anyOf": [
{
"type": "object",
"additionalProperties": false,
"required": [
"kink_pairs",
"coordinates",
"cocycle_basis",
"coboundary_basis",
"quotient_representative_basis",
"dimensions",
"cocycle_count",
"coboundary_count",
"class_count"
],
"properties": {
"kink_pairs": {
"type": "array",
"minItems": 1,
"maxItems": 3,
"items": {
"type": "array",
"minItems": 2,
"maxItems": 2,
"items": {
"type": "integer",
"minimum": 0,
"maximum": 2
}
}
},
"coordinates": {
"type": "array",
"minItems": 0,
"maxItems": 6,
"items": {
"type": "array",
"minItems": 2,
"maxItems": 2,
"items": {
"type": "integer",
"minimum": 0,
"maximum": 2
}
}
},
"cocycle_basis": {
"type": "array",
"minItems": 0,
"maxItems": 6,
"items": {
"type": "array",
"minItems": 0,
"maxItems": 6,
"items": {
"type": "integer",
"minimum": 0,
"maximum": 2
}
}
},
"coboundary_basis": {
"type": "array",
"minItems": 0,
"maxItems": 6,
"items": {
"type": "array",
"minItems": 0,
"maxItems": 6,
"items": {
"type": "integer",
"minimum": 0,
"maximum": 2
}
}
},
"quotient_representative_basis": {
"type": "array",
"minItems": 0,
"maxItems": 6,
"items": {
"type": "array",
"minItems": 0,
"maxItems": 6,
"items": {
"type": "integer",
"minimum": 0,
"maximum": 2
}
}
},
"dimensions": {
"type": "object",
"additionalProperties": false,
"required": [
"Z2_typeI",
"B2",
"H2_typeI"
],
"properties": {
"Z2_typeI": {
"type": "integer",
"minimum": 0,
"maximum": 6
},
"B2": {
"type": "integer",
"minimum": 0,
"maximum": 6
},
"H2_typeI": {
"type": "integer",
"minimum": 0,
"maximum": 6
}
}
},
"cocycle_count": {
"type": "integer",
"minimum": 1,
"maximum": 729
},
"coboundary_count": {
"type": "integer",
"minimum": 1,
"maximum": 729
},
"class_count": {
"type": "integer",
"minimum": 1,
"maximum": 729
}
}
},
{
"type": "null"
}
]
}
}
}Published input example
{
"R1": [
[
0,
1
],
[
0,
1
]
],
"R2": [
[
0,
0
],
[
1,
1
]
],
"p": 3,
"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.