HALOWERKDatenvertragswerk
primitive quadratic class inventory
For an original negative discriminant D from-160through-3 with D congruent0or1mod4, reconstruct the complete primitive positive definite binary quadratic form class inventory. Return every integer[a,b,c] for ax^2+bxy+cy^2 with b^2-4ac=D,gcd(a,b,c)=1,|b|<=a<=c; when |b|=a or a=c choose b>=0. Forms sort numeric lexicographically, and class_count is the number of primitive proper SL2Z-equivalence classes. Nonfundamental discriminants are allowed with imprimitive forms OMITTED; count concerns.
POST https://datenvertrag.halowerk.com/v1/primitive-quadratic-class-inventoryEingaben
| Feld | Typ | Pflicht | Beschreibung |
|---|---|---|---|
| discriminant | Siehe Schema | Ja | |
| claimed_forms | Siehe Schema | Ja |
Vollständiges Eingabeschema anzeigen
{
"type": "object",
"additionalProperties": false,
"required": [
"discriminant",
"claimed_forms"
],
"properties": {
"discriminant": {
"anyOf": [
{
"type": "integer",
"minimum": -160,
"maximum": -3
},
{
"type": "null"
}
]
},
"claimed_forms": {
"anyOf": [
{
"type": "array",
"maxItems": 64,
"items": {
"type": "array",
"maxItems": 3,
"items": {
"type": "integer",
"minimum": -160,
"maximum": 160
},
"minItems": 3
}
},
{
"type": "null"
}
]
}
}
}Veröffentlichtes Eingabebeispiel
{
"discriminant": -63,
"claimed_forms": [
[
1,
1,
16
],
[
2,
-1,
8
],
[
2,
1,
8
],
[
4,
1,
4
]
]
}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