Datenvertragswerk
even lattice isotropic overlattice inventory
From an even nonsingular integral Gram matrix, enumerate EVERY embedded even finite-index overlattice, including the original lattice. Return full dual classes/addition and Q/2Z quadratic norms, every isotropic subgroup, canonical rational lattice bases, integral Gram/inclusion matrices and indices. Distinct embedded but isometric lattices remain distinct; ranks1..2, entries-8..8, determinant absolute1..16.
POST https://datenvertrag.halowerk.com/v1/even-lattice-isotropic-overlattice-inventoryInputs
| Field | Type | Required | Description |
|---|---|---|---|
| gram | See schema | Yes | |
| claim | See schema | Yes |
Show full input schema
{
"type": "object",
"additionalProperties": false,
"required": [
"gram",
"claim"
],
"properties": {
"gram": {
"anyOf": [
{
"type": "array",
"maxItems": 2,
"minItems": 1,
"items": {
"type": "array",
"maxItems": 2,
"minItems": 1,
"items": {
"type": "integer",
"minimum": -8,
"maximum": 8
}
}
},
{
"type": "null"
}
]
},
"claim": {
"anyOf": [
{
"type": "object",
"additionalProperties": false,
"required": [
"dual_class_representatives",
"class_addition",
"quadratic_norm_mod2",
"isotropic_subgroup_masks",
"overlattices",
"count"
],
"properties": {
"dual_class_representatives": {
"type": "array",
"maxItems": 16,
"minItems": 1,
"items": {
"type": "array",
"maxItems": 2,
"minItems": 1,
"items": {
"type": "string",
"maxLength": 6,
"pattern": "^-?(0|[1-9][0-9]*)(/[1-9][0-9]*)?$"
}
}
},
"class_addition": {
"type": "array",
"maxItems": 16,
"minItems": 1,
"items": {
"type": "array",
"maxItems": 16,
"minItems": 1,
"items": {
"type": "integer",
"minimum": 0,
"maximum": 15
}
}
},
"quadratic_norm_mod2": {
"type": "array",
"maxItems": 16,
"minItems": 1,
"items": {
"type": "string",
"maxLength": 6,
"pattern": "^-?(0|[1-9][0-9]*)(/[1-9][0-9]*)?$"
}
},
"isotropic_subgroup_masks": {
"type": "array",
"maxItems": 11,
"minItems": 1,
"items": {
"type": "integer",
"minimum": 1,
"maximum": 65535
}
},
"overlattices": {
"type": "array",
"maxItems": 11,
"minItems": 1,
"items": {
"type": "object",
"additionalProperties": false,
"required": [
"isotropic_mask",
"subgroup_members",
"index",
"basis_columns",
"overlattice_gram",
"original_lattice_inclusion",
"discriminant_order"
],
"properties": {
"isotropic_mask": {
"type": "integer",
"minimum": 1,
"maximum": 65535
},
"subgroup_members": {
"type": "array",
"maxItems": 4,
"minItems": 1,
"items": {
"type": "integer",
"minimum": 0,
"maximum": 15
}
},
"index": {
"type": "integer",
"minimum": 1,
"maximum": 4
},
"basis_columns": {
"type": "array",
"maxItems": 2,
"minItems": 1,
"items": {
"type": "array",
"maxItems": 2,
"minItems": 1,
"items": {
"type": "string",
"maxLength": 6,
"pattern": "^-?(0|[1-9][0-9]*)(/[1-9][0-9]*)?$"
}
}
},
"overlattice_gram": {
"type": "array",
"maxItems": 2,
"minItems": 1,
"items": {
"type": "array",
"maxItems": 2,
"minItems": 1,
"items": {
"type": "integer",
"minimum": -32,
"maximum": 32
}
}
},
"original_lattice_inclusion": {
"type": "array",
"maxItems": 2,
"minItems": 1,
"items": {
"type": "array",
"maxItems": 2,
"minItems": 1,
"items": {
"type": "integer",
"minimum": -16,
"maximum": 16
}
}
},
"discriminant_order": {
"type": "integer",
"minimum": 1,
"maximum": 16
}
}
}
},
"count": {
"type": "integer",
"minimum": 1,
"maximum": 11
}
}
},
{
"type": "null"
}
]
}
}
}Published input example
{
"gram": [
[
8
]
],
"claim": null
}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.