Datenvertragswerk
finite quadratic module witt decomposition
From an explicitly supplied finite abelian group addition table and homogeneous quadratic refinement q:A->Q/Z, construct a canonical orthogonal decomposition into indecomposable nondegenerate subgroups, complete block addition/q tables and a coordinate isometry. Separately construct a largest isotropic subgroup H, its orthogonal complement and the full quadratic quotient Hperp/H, which is anisotropic and Witt-equivalent. Return the entire polar pairing, subgroup witnesses, quotient tables.
POST https://datenvertrag.halowerk.com/v1/finite-quadratic-module-witt-decompositionInputs
| Field | Type | Required | Description |
|---|---|---|---|
| addition | See schema | Yes | |
| denominator | See schema | Yes | |
| q_numerators | See schema | Yes | |
| claim | See schema | Yes |
Show full input schema
{
"type": "object",
"additionalProperties": false,
"required": [
"addition",
"denominator",
"q_numerators",
"claim"
],
"properties": {
"addition": {
"anyOf": [
{
"type": "array",
"minItems": 2,
"maxItems": 8,
"items": {
"type": "array",
"minItems": 2,
"maxItems": 8,
"items": {
"type": "integer",
"minimum": 0,
"maximum": 7
}
}
},
{
"type": "null"
}
]
},
"denominator": {
"anyOf": [
{
"type": "integer",
"minimum": 2,
"maximum": 16
},
{
"type": "null"
}
]
},
"q_numerators": {
"anyOf": [
{
"type": "array",
"minItems": 2,
"maxItems": 8,
"items": {
"type": "integer",
"minimum": 0,
"maximum": 15
}
},
{
"type": "null"
}
]
},
"claim": {
"anyOf": [
{
"type": "object",
"additionalProperties": false,
"required": [
"polar_numerators",
"indecomposable_factor_masks",
"blocks",
"factor_coordinates",
"orthogonal_factorization_count",
"isotropic_subgroup",
"maximum_isotropic_order",
"orthogonal_complement",
"quotient_cosets",
"quotient_addition",
"quotient_q_numerators",
"quotient_is_anisotropic",
"metabolic",
"original_is_anisotropic"
],
"properties": {
"polar_numerators": {
"type": "array",
"minItems": 2,
"maxItems": 8,
"items": {
"type": "array",
"minItems": 2,
"maxItems": 8,
"items": {
"type": "integer",
"minimum": 0,
"maximum": 15
}
}
},
"indecomposable_factor_masks": {
"type": "array",
"minItems": 1,
"maxItems": 3,
"items": {
"type": "integer",
"minimum": 1,
"maximum": 255
}
},
"blocks": {
"type": "array",
"minItems": 1,
"maxItems": 3,
"items": {
"type": "object",
"additionalProperties": false,
"required": [
"members",
"addition",
"q_numerators"
],
"properties": {
"members": {
"type": "array",
"minItems": 1,
"maxItems": 8,
"items": {
"type": "integer",
"minimum": 0,
"maximum": 7
}
},
"addition": {
"type": "array",
"minItems": 1,
"maxItems": 8,
"items": {
"type": "array",
"minItems": 1,
"maxItems": 8,
"items": {
"type": "integer",
"minimum": 0,
"maximum": 7
}
}
},
"q_numerators": {
"type": "array",
"minItems": 1,
"maxItems": 8,
"items": {
"type": "integer",
"minimum": 0,
"maximum": 15
}
}
}
}
},
"factor_coordinates": {
"type": "array",
"minItems": 2,
"maxItems": 8,
"items": {
"type": "array",
"minItems": 1,
"maxItems": 3,
"items": {
"type": "integer",
"minimum": 0,
"maximum": 7
}
}
},
"orthogonal_factorization_count": {
"type": "integer",
"minimum": 1,
"maximum": 400000
},
"isotropic_subgroup": {
"type": "array",
"minItems": 1,
"maxItems": 8,
"items": {
"type": "integer",
"minimum": 0,
"maximum": 7
}
},
"maximum_isotropic_order": {
"type": "integer",
"minimum": 1,
"maximum": 8
},
"orthogonal_complement": {
"type": "array",
"minItems": 1,
"maxItems": 8,
"items": {
"type": "integer",
"minimum": 0,
"maximum": 7
}
},
"quotient_cosets": {
"type": "array",
"minItems": 1,
"maxItems": 8,
"items": {
"type": "array",
"minItems": 1,
"maxItems": 8,
"items": {
"type": "integer",
"minimum": 0,
"maximum": 7
}
}
},
"quotient_addition": {
"type": "array",
"minItems": 1,
"maxItems": 8,
"items": {
"type": "array",
"minItems": 1,
"maxItems": 8,
"items": {
"type": "integer",
"minimum": 0,
"maximum": 7
}
}
},
"quotient_q_numerators": {
"type": "array",
"minItems": 1,
"maxItems": 8,
"items": {
"type": "integer",
"minimum": 0,
"maximum": 15
}
},
"quotient_is_anisotropic": {
"const": true
},
"metabolic": {
"type": "boolean"
},
"original_is_anisotropic": {
"type": "boolean"
}
}
},
{
"type": "null"
}
]
}
}
}Published input example
{
"addition": [
[
0,
1,
2,
3
],
[
1,
0,
3,
2
],
[
2,
3,
0,
1
],
[
3,
2,
1,
0
]
],
"denominator": 8,
"q_numerators": [
0,
0,
0,
4
],
"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.