Datenvertragswerk
integer lattice discriminant bilinear form
For a symmetric nonsingular integer Gram matrix of size 1 or 2 with entries -8..8 and 1<=abs(det)<=16, returns every dual-lattice class L*/L, the full addition table, element orders, the complete Q/Z bilinear pairing x^T G y mod 1, the inverse Gram matrix and a first nonzero pairing witness for each nonidentity element. Canonical representatives are L* intersect [0,1)^n; labels are not GL(n,Z)-invariant. No quadratic refinement or even-lattice assumption.
POST https://datenvertrag.halowerk.com/v1/integer-lattice-discriminant-bilinear-formInputs
| Field | Type | Required | Description |
|---|---|---|---|
| gram | See schema | Yes | |
| pairing_claim | See schema | Yes |
Show full input schema
{
"type": "object",
"properties": {
"gram": {
"anyOf": [
{
"type": "array",
"items": {
"type": "array",
"items": {
"type": "integer",
"minimum": -8,
"maximum": 8
},
"minItems": 1,
"maxItems": 2
},
"minItems": 1,
"maxItems": 2
},
{
"type": "null"
}
]
},
"pairing_claim": {
"anyOf": [
{
"type": "array",
"items": {
"type": "array",
"items": {
"type": "string",
"pattern": "^(0|[1-9][0-9]?)/[1-9][0-9]?$",
"maxLength": 5
},
"minItems": 1,
"maxItems": 16
},
"minItems": 1,
"maxItems": 16
},
{
"type": "null"
}
]
}
},
"required": [
"gram",
"pairing_claim"
],
"additionalProperties": false
}Published input example
{
"gram": [
[
1,
0
],
[
0,
3
]
],
"pairing_claim": [
[
"0/1",
"0/1",
"0/1"
],
[
"0/1",
"1/3",
"2/3"
],
[
"0/1",
"2/3",
"1/3"
]
]
}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.