HALOWERKDatenvertragswerk
rational polynomial bezout ledger
For twointegerpolynomials degree<=3 in ascendingpowers, return monicQ[x]gcdG, exactA/G,B/G and rationalS,T withSA+TB=G. CanonicalS has degree<deg(B/G); B=0 usesS=1/lead(A),T=0; bothzero yieldsallzero(emptyarrays). Wholeidentitycoefficients returned. ClaimcomparesG mathematically; nullpolynomial/claim unknown. Fixed.003USDC alsovalidunknown. Noapproximate roots/CAS/networkcalls.
POST https://datenvertrag.halowerk.com/v1/rational-polynomial-bezout-ledgerEingaben
| Feld | Typ | Pflicht | Beschreibung |
|---|---|---|---|
| a | Siehe Schema | Ja | |
| b | Siehe Schema | Ja | |
| claimed_gcd | Siehe Schema | Ja |
Vollständiges Eingabeschema anzeigen
{
"$schema": "http://json-schema.org/draft-07/schema#",
"type": "object",
"additionalProperties": false,
"required": [
"a",
"b",
"claimed_gcd"
],
"properties": {
"a": {
"anyOf": [
{
"type": "array",
"minItems": 1,
"maxItems": 4,
"items": {
"type": "integer",
"minimum": -3,
"maximum": 3
}
},
{
"type": "null"
}
]
},
"b": {
"anyOf": [
{
"type": "array",
"minItems": 1,
"maxItems": 4,
"items": {
"type": "integer",
"minimum": -3,
"maximum": 3
}
},
{
"type": "null"
}
]
},
"claimed_gcd": {
"anyOf": [
{
"type": "array",
"maxItems": 4,
"items": {
"type": "object",
"additionalProperties": false,
"required": [
"numerator",
"denominator"
],
"properties": {
"numerator": {
"type": "integer",
"minimum": -100000000,
"maximum": 100000000
},
"denominator": {
"type": "integer",
"minimum": 1,
"maximum": 100000000
}
}
}
},
{
"type": "null"
}
]
}
}
}Veröffentlichtes Eingabebeispiel
{
"a": [
-1,
0,
1
],
"b": [
-1,
1
],
"claimed_gcd": [
{
"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