HALOWERKDatenvertragswerk
exact pole principal part audit
For numerator integer coefficients in ascendingpower order (degree<=7) and1..3 distinct integer poles with multiplicities (total denominator degree<=6), returns monic denominator, complete polynomialpart, propernumerator and every exact reduced principalpart coefficient for each sortedroot/ascendingnegativepower. Zero coefficients after cancellation remain explicit. Audit entire polynomialpart and flattened canonical coefficient list. Does not factor an unknown denominator, infer complex.
POST https://datenvertrag.halowerk.com/v1/exact-pole-principal-part-auditEingaben
| Feld | Typ | Pflicht | Beschreibung |
|---|---|---|---|
| numerator | array | Ja | |
| poles | array | Ja | |
| claimed | Siehe Schema | Ja |
Vollständiges Eingabeschema anzeigen
{
"type": "object",
"properties": {
"numerator": {
"type": "array",
"minItems": 1,
"maxItems": 8,
"items": {
"anyOf": [
{
"type": "integer",
"minimum": -20,
"maximum": 20
},
{
"type": "null"
}
]
}
},
"poles": {
"type": "array",
"minItems": 1,
"maxItems": 3,
"items": {
"anyOf": [
{
"type": "object",
"properties": {
"root": {
"type": "integer",
"minimum": -3,
"maximum": 3
},
"multiplicity": {
"type": "integer",
"minimum": 1,
"maximum": 3
}
},
"required": [
"root",
"multiplicity"
],
"additionalProperties": false
},
{
"type": "null"
}
]
}
},
"claimed": {
"anyOf": [
{
"type": "object",
"properties": {
"polynomial_part": {
"type": "array",
"minItems": 1,
"maxItems": 8,
"items": {
"type": "integer",
"minimum": -1000000,
"maximum": 1000000
}
},
"coefficients": {
"type": "array",
"maxItems": 6,
"items": {
"type": "object",
"properties": {
"numerator": {
"type": "string",
"pattern": "^-?(0|[1-9][0-9]{0,29})$"
},
"denominator": {
"type": "string",
"pattern": "^[1-9][0-9]{0,29}$"
}
},
"required": [
"numerator",
"denominator"
],
"additionalProperties": false
}
}
},
"required": [
"polynomial_part",
"coefficients"
],
"additionalProperties": false
},
{
"type": "null"
}
]
}
},
"required": [
"numerator",
"poles",
"claimed"
],
"additionalProperties": false
}Veröffentlichtes Eingabebeispiel
{
"numerator": [
1
],
"poles": [
{
"root": 0,
"multiplicity": 1
},
{
"root": 1,
"multiplicity": 1
}
],
"claimed": {
"polynomial_part": [
0
],
"coefficients": [
{
"numerator": "-1",
"denominator": "1"
},
{
"numerator": "1",
"denominator": "1"
}
]
}
}Ergebnis & Dokumentation
Maschinenlesbare Dokumentation dieses Hubs
Quelle dieser Seite: der veröffentlichte HALOWERK-Katalog. Stand: 2026-11-07, 02:42 UTC.
Weitere Endpunkte dieses Hubs
- Datenvertragswerk0,003 USDC
adjacency cospectral graph family
POSThttps://datenvertrag.halowerk.com/v1/adjacency-cospectral-graph-familyGiven n1..5 and a monic degree-n integer polynomial det(xI-A), return EVERY labelled simple undirected graph on vertices0..n-1 having exactly that adjacency characteristic polynomial over integers. Coefficients are descending degree order,
- 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.
- Datenvertragswerk0,003 USDC
aligned record cut audit
POSThttps://datenvertrag.halowerk.com/v1/aligned-record-cut-auditA stream-runtime fixture maintainer checks which record IDs belong to a supplied aligned checkpoint cut and which same-channel post-barrier records must stay buffered until all input barriers arrive. One aligned local checkpoint;record iden