HALOWERKDatenvertragswerk
exact matrix minimal polynomial audit
For supplied1..4square integer matrix entries-3..3, returns leastdegree monic rational annihilating polynomial with all integral coefficients in ascendingpower order, every powerI..A^d and the exact zero matrix from polynomial evaluation. A nonminimal annihilating polynomial is still a wrong canonical claim. Scalar2I and nondiagonalizable Jordan2 share characteristic polynomial but have different minimal polynomial. This is not a scalar finite-prefix recurrence, finitefield Frobenius.
POST https://datenvertrag.halowerk.com/v1/exact-matrix-minimal-polynomial-auditEingaben
| Feld | Typ | Pflicht | Beschreibung |
|---|---|---|---|
| matrix | array | Ja | |
| claimed | Siehe Schema | Ja |
Vollständiges Eingabeschema anzeigen
{
"type": "object",
"properties": {
"matrix": {
"type": "array",
"minItems": 1,
"maxItems": 4,
"items": {
"type": "array",
"minItems": 1,
"maxItems": 4,
"items": {
"anyOf": [
{
"type": "integer",
"minimum": -3,
"maximum": 3
},
{
"type": "null"
}
]
}
}
},
"claimed": {
"anyOf": [
{
"type": "array",
"maxItems": 5,
"items": {
"type": "integer",
"minimum": -32768,
"maximum": 32768
}
},
{
"type": "null"
}
]
}
},
"required": [
"matrix",
"claimed"
],
"additionalProperties": false
}Veröffentlichtes Eingabebeispiel
{
"matrix": [
[
2,
1
],
[
0,
2
]
],
"claimed": [
4,
-4,
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