Datenvertragswerk
rational polytope minkowski indecomposability witness
From the ORIGINAL complete extreme vertices of a rational convex3polytope, determine its entire Minkowski edge length deformation cone and whether EVERY real convex Minkowski summand is a translated dilation. Derive all supporting facet cycles and original edges; construct all face closure equations, full exact canonical nullspace, rank and universal edge dependency classes. If decomposable, construct TWO complete nonhomothetic rational summand vertex arrays, both edge scaling vectors and.
POST https://datenvertrag.halowerk.com/v1/rational-polytope-minkowski-indecomposability-witnessInputs
| Field | Type | Required | Description |
|---|---|---|---|
| vertices | See schema | Yes | |
| claim_sha256 | See schema | Yes |
Show full input schema
{
"type": "object",
"additionalProperties": false,
"required": [
"vertices",
"claim_sha256"
],
"properties": {
"vertices": {
"anyOf": [
{
"type": "array",
"items": {
"type": "array",
"items": {
"enum": [
"-2",
"-1",
"-1/2",
"0",
"1/2",
"1",
"2"
]
},
"minItems": 3,
"maxItems": 3
},
"minItems": 4,
"maxItems": 6
},
{
"type": "null"
}
]
},
"claim_sha256": {
"anyOf": [
{
"type": "string",
"pattern": "^[0-9a-f]{64}$",
"minLength": 64,
"maxLength": 64
},
{
"type": "null"
}
]
}
}
}Published input example
{
"vertices": [
[
"0",
"0",
"0"
],
[
"0",
"0",
"1"
],
[
"0",
"1",
"0"
],
[
"1/2",
"0",
"0"
]
],
"claim_sha256": 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.