Datenvertragswerk
rational polyhedron projection farkas certificate
Project an original full-dimensional nonempty rational H-polyhedron{(y,z):A(y,z)<=b} onto ALL remaining REAL y by eliminating its last real coordinate z. Source dimension2or3,0..6inequalities,canonical rationals numerator abs<=4/denominator1..4. Return the entire exact projected irredundant H-description,all normalized Fourier-Motzkin rows with nonnegative ORIGINAL-source multipliers,and exact redundancy/irredundancy witnesses. Unbounded images and lineality admitted. Projection means.
POST https://datenvertrag.halowerk.com/v1/rational-polyhedron-projection-farkas-certificateInputs
| Field | Type | Required | Description |
|---|---|---|---|
| dimension | integer | Yes | |
| A | array | Yes | |
| b | array | Yes | |
| claim_projection | See schema | Yes |
Show full input schema
{
"type": "object",
"additionalProperties": false,
"required": [
"dimension",
"A",
"b",
"claim_projection"
],
"properties": {
"dimension": {
"type": "integer",
"minimum": 2,
"maximum": 3
},
"A": {
"type": "array",
"items": {
"type": "array",
"items": {
"type": "string",
"maxLength": 4,
"pattern": "^(?:0|-?[1-9][0-9]*)(?:/[1-9][0-9]*)?$"
},
"minItems": 2,
"maxItems": 3
},
"minItems": 0,
"maxItems": 6
},
"b": {
"type": "array",
"items": {
"type": "string",
"maxLength": 4,
"pattern": "^(?:0|-?[1-9][0-9]*)(?:/[1-9][0-9]*)?$"
},
"minItems": 0,
"maxItems": 6
},
"claim_projection": {
"anyOf": [
{
"type": "null"
},
{
"type": "array",
"items": {
"type": "object",
"additionalProperties": false,
"required": [
"normal",
"bound"
],
"properties": {
"normal": {
"type": "array",
"items": {
"type": "string",
"maxLength": 5,
"pattern": "^(?:0|-?[1-9][0-9]*)$"
},
"minItems": 1,
"maxItems": 2
},
"bound": {
"type": "string",
"maxLength": 5,
"pattern": "^(?:0|-?[1-9][0-9]*)$"
}
}
},
"minItems": 0,
"maxItems": 9
}
]
}
}
}Published input example
{
"dimension": 3,
"A": [
[
"-1",
"0",
"0"
],
[
"0",
"-1",
"0"
],
[
"0",
"0",
"-1"
],
[
"1",
"1",
"1"
]
],
"b": [
"0",
"0",
"0",
"1"
],
"claim_projection": [
{
"normal": [
"-1",
"0"
],
"bound": "0"
},
{
"normal": [
"0",
"-1"
],
"bound": "0"
},
{
"normal": [
"1",
"1"
],
"bound": "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.