Datenvertragswerk
finite poset incidence algebra derivations
Input strict transitive irreflexive Boolean ordermatrix on1..4 original labels. Algebra overQQ has intervals(i,j),i<=j,sorted numeric lex,product Eij*Ekl=delta_jk Eil. Return ENTIRE derivation andinnerderivation spaces and quotient Der/Inn as explicit ordered sparseendomorphism bases,dimensions[Der,Inn,Out] and complete outerLiebracket(nonzero list empty:Schur representatives commute). Sparse term index=output_interval*m+input_interval;nonzero terms ascending unique,canonicalreduced rational.
POST https://datenvertrag.halowerk.com/v1/finite-poset-incidence-algebra-derivationsInputs
| Field | Type | Required | Description |
|---|---|---|---|
| relations | See schema | Yes | |
| claim | See schema | Yes |
Show full input schema
{
"type": "object",
"properties": {
"relations": {
"anyOf": [
{
"type": "array",
"items": {
"type": "array",
"items": {
"type": "boolean"
},
"minItems": 1,
"maxItems": 4
},
"minItems": 1,
"maxItems": 4
},
{
"type": "null"
}
]
},
"claim": {
"anyOf": [
{
"type": "object",
"properties": {
"intervals": {
"type": "array",
"items": {
"type": "array",
"items": {
"type": "integer",
"minimum": 0,
"maximum": 3
},
"minItems": 2,
"maxItems": 2
},
"minItems": 1,
"maxItems": 10
},
"dimensions": {
"type": "array",
"items": {
"type": "integer",
"minimum": 0,
"maximum": 12
},
"minItems": 3,
"maxItems": 3
},
"derivation_basis": {
"type": "array",
"items": {
"type": "array",
"items": {
"type": "object",
"properties": {
"index": {
"type": "integer",
"minimum": 0,
"maximum": 99
},
"value": {
"type": "string",
"pattern": "^-?[1-9]/[1-9]$",
"maxLength": 4
}
},
"required": [
"index",
"value"
],
"additionalProperties": false
},
"minItems": 1,
"maxItems": 8
},
"minItems": 0,
"maxItems": 12
},
"inner_basis": {
"type": "array",
"items": {
"type": "array",
"items": {
"type": "object",
"properties": {
"index": {
"type": "integer",
"minimum": 0,
"maximum": 99
},
"value": {
"type": "string",
"pattern": "^-?[1-9]/[1-9]$",
"maxLength": 4
}
},
"required": [
"index",
"value"
],
"additionalProperties": false
},
"minItems": 1,
"maxItems": 8
},
"minItems": 0,
"maxItems": 9
},
"outer_basis": {
"type": "array",
"items": {
"type": "array",
"items": {
"type": "object",
"properties": {
"index": {
"type": "integer",
"minimum": 0,
"maximum": 99
},
"value": {
"type": "string",
"pattern": "^-?[1-9]/[1-9]$",
"maxLength": 4
}
},
"required": [
"index",
"value"
],
"additionalProperties": false
},
"minItems": 1,
"maxItems": 8
},
"minItems": 0,
"maxItems": 6
},
"outer_bracket_nonzero": {
"type": "array",
"items": {},
"minItems": 0,
"maxItems": 0
},
"complete": {
"const": true
}
},
"required": [
"intervals",
"dimensions",
"derivation_basis",
"inner_basis",
"outer_basis",
"outer_bracket_nonzero",
"complete"
],
"additionalProperties": false
},
{
"type": "null"
}
]
}
},
"required": [
"relations",
"claim"
],
"additionalProperties": false
}Published input example
{
"relations": [
[
false,
true
],
[
false,
false
]
],
"claim": {
"intervals": [
[
0,
0
],
[
0,
1
],
[
1,
1
]
],
"dimensions": [
2,
2,
0
],
"derivation_basis": [
[
{
"index": 3,
"value": "-1/1"
},
{
"index": 5,
"value": "1/1"
}
],
[
{
"index": 4,
"value": "1/1"
}
]
],
"inner_basis": [
[
{
"index": 3,
"value": "-1/1"
},
{
"index": 5,
"value": "1/1"
}
],
[
{
"index": 4,
"value": "-1/1"
}
]
],
"outer_basis": [],
"outer_bracket_nonzero": [],
"complete": true
}
}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.