Datenvertragswerk
free group fox derivative matrix
For a supplied rank1..4 free group and 0..6 relator words, return every Fox partial derivative in Z[F], with reduced-word sparse integer terms, sorted lexicographically and zero coefficients removed. Signed letters +j/-j denote generators/inverses; zero and letters outside rank are invalid. Each word has at most16 letters, including unreduced cancellation. Left Fox convention D_j(uv)=D_j(u)+u D_j(v); D_j(x_i)=delta_ij and D_j(x_i^-1)=-delta_ij*x_i^-1. Return all reduced relators, derivative.
POST https://datenvertrag.halowerk.com/v1/free-group-fox-derivative-matrixInputs
| Field | Type | Required | Description |
|---|---|---|---|
| rank | integer | Yes | |
| relators | See schema | Yes | |
| claim | See schema | Yes |
Show full input schema
{
"type": "object",
"properties": {
"rank": {
"type": "integer",
"minimum": 1,
"maximum": 4
},
"relators": {
"anyOf": [
{
"type": "array",
"items": {
"type": "array",
"items": {
"type": "integer",
"minimum": -4,
"maximum": 4,
"not": {
"const": 0
}
},
"maxItems": 16
},
"maxItems": 6
},
{
"type": "null"
}
]
},
"claim": {
"anyOf": [
{
"type": "array",
"items": {
"type": "array",
"items": {
"type": "array",
"items": {
"type": "object",
"properties": {
"word": {
"type": "array",
"items": {
"type": "integer",
"minimum": -4,
"maximum": 4,
"not": {
"const": 0
}
},
"maxItems": 16
},
"coefficient": {
"type": "integer",
"minimum": -16,
"maximum": 16,
"not": {
"const": 0
}
}
},
"required": [
"word",
"coefficient"
],
"additionalProperties": false
},
"maxItems": 16
},
"maxItems": 4
},
"maxItems": 6
},
{
"type": "null"
}
]
}
},
"required": [
"rank",
"relators",
"claim"
],
"additionalProperties": false
}Published input example
{
"rank": 2,
"relators": [
[
1,
2,
-1,
-2
]
],
"claim": [
[
[
{
"word": [],
"coefficient": 1
},
{
"word": [
1,
2,
-1
],
"coefficient": -1
}
],
[
{
"word": [
1
],
"coefficient": 1
},
{
"word": [
1,
2,
-1,
-2
],
"coefficient": -1
}
]
]
]
}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.