Datenvertragswerk
rational polynomial sturm tarski query
Computes a Sturm-Tarski query: the sum of sign(Q(x)) over the distinct real zeros of P in the open interval (a,b) (positive +1, negative -1, Q zero 0); repeated zeros of P count once. Inputs are rational coefficients in ascending powers (P degree <=5, Q degree <=2) and rational endpoints, each canonical n/d with |n|<=8, d 1..4. Returns the monic squarefree P and the exact negative Euclidean remainder chain with V(a)-V(b)=query. Requires a<b and P(a)P(b)!=0.
POST https://datenvertrag.halowerk.com/v1/rational-polynomial-sturm-tarski-queryInputs
| Field | Type | Required | Description |
|---|---|---|---|
| P | See schema | Yes | |
| Q | See schema | Yes | |
| a | See schema | Yes | |
| b | See schema | Yes | |
| claim | See schema | Yes |
Show full input schema
{
"type": "object",
"properties": {
"P": {
"anyOf": [
{
"type": "array",
"items": {
"type": "string",
"pattern": "^-?[0-8]/[1-4]$",
"maxLength": 4
},
"minItems": 1,
"maxItems": 6
},
{
"type": "null"
}
]
},
"Q": {
"anyOf": [
{
"type": "array",
"items": {
"type": "string",
"pattern": "^-?[0-8]/[1-4]$",
"maxLength": 4
},
"minItems": 1,
"maxItems": 3
},
{
"type": "null"
}
]
},
"a": {
"anyOf": [
{
"type": "string",
"pattern": "^-?[0-8]/[1-4]$",
"maxLength": 4
},
{
"type": "null"
}
]
},
"b": {
"anyOf": [
{
"type": "string",
"pattern": "^-?[0-8]/[1-4]$",
"maxLength": 4
},
{
"type": "null"
}
]
},
"claim": {
"anyOf": [
{
"type": "integer",
"minimum": -5,
"maximum": 5
},
{
"type": "null"
}
]
}
},
"required": [
"P",
"Q",
"a",
"b",
"claim"
],
"additionalProperties": false
}Published input example
{
"P": [
"0/1",
"2/1",
"-3/1",
"1/1"
],
"Q": [
"0/1",
"1/1"
],
"a": "1/2",
"b": "3/2",
"claim": 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.