Datenvertragswerk
integer lattice coset intersection
For two lattice cosets, each given by column-Hermite parameters [a,b,c] generating (a,0),(b,c) with a,c 1..4 and 0<=b<a, plus offset coordinates -8..8, computes the complete coset intersection. Returns the canonical common lattice basis [(A,0),(B,C)] with A,C positive and 0<=B<A, a representative with 0<=x<A, 0<=y<C if compatible (else null) and a nonempty flag; all solutions equal the representative plus the common lattice. Not a nearest lattice point query.
POST https://datenvertrag.halowerk.com/v1/integer-lattice-coset-intersectionInputs
| Field | Type | Required | Description |
|---|---|---|---|
| left | See schema | Yes | |
| right | See schema | Yes | |
| claim | See schema | Yes |
Show full input schema
{
"type": "object",
"properties": {
"left": {
"anyOf": [
{
"type": "object",
"properties": {
"hnf": {
"type": "array",
"items": {
"type": "integer",
"minimum": 0,
"maximum": 4
},
"minItems": 3,
"maxItems": 3
},
"offset": {
"type": "array",
"items": {
"type": "integer",
"minimum": -8,
"maximum": 8
},
"minItems": 2,
"maxItems": 2
}
},
"required": [
"hnf",
"offset"
],
"additionalProperties": false
},
{
"type": "null"
}
]
},
"right": {
"anyOf": [
{
"type": "object",
"properties": {
"hnf": {
"type": "array",
"items": {
"type": "integer",
"minimum": 0,
"maximum": 4
},
"minItems": 3,
"maxItems": 3
},
"offset": {
"type": "array",
"items": {
"type": "integer",
"minimum": -8,
"maximum": 8
},
"minItems": 2,
"maxItems": 2
}
},
"required": [
"hnf",
"offset"
],
"additionalProperties": false
},
{
"type": "null"
}
]
},
"claim": {
"anyOf": [
{
"type": "object",
"properties": {
"representative": {
"anyOf": [
{
"type": "array",
"items": {
"type": "integer",
"minimum": -1000,
"maximum": 1000
},
"minItems": 2,
"maxItems": 2
},
{
"type": "null"
}
]
},
"basis": {
"type": "array",
"items": {
"type": "array",
"items": {
"type": "integer",
"minimum": -1000,
"maximum": 1000
},
"minItems": 2,
"maxItems": 2
},
"minItems": 2,
"maxItems": 2
},
"nonempty": {
"type": "boolean"
}
},
"required": [
"representative",
"basis",
"nonempty"
],
"additionalProperties": false
},
{
"type": "null"
}
]
}
},
"required": [
"left",
"right",
"claim"
],
"additionalProperties": false
}Published input example
{
"left": {
"hnf": [
2,
0,
2
],
"offset": [
0,
0
]
},
"right": {
"hnf": [
3,
0,
3
],
"offset": [
1,
1
]
},
"claim": {
"representative": [
4,
4
],
"basis": [
[
6,
0
],
[
0,
6
]
],
"nonempty": true
}
}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.