Datenvertragswerk
finite field quadratic witt decomposition
For a symmetric n by n Gram matrix A, n=1..4, over the prime field p=3 or5, use q(x)=x A x^T. Return row basis B, G=B A B^T, hyperbolic_planes h, anisotropic_dimension a and radical_dimension r. Basis order consists of h adjacent hyperbolic pairs with Gram [[0,1],[1,0]], then an anisotropic block, then radical basis. All cross blocks are zero; n=2h+a+r. Exhaustive lexicographic vector enumeration and rank extension fix the witness. The radical does not contribute to h; no claim of Magma.
POST https://datenvertrag.halowerk.com/v1/finite-field-quadratic-witt-decompositionInputs
| Field | Type | Required | Description |
|---|---|---|---|
| p | See schema | Yes | |
| matrix | array | Yes | |
| claim | See schema | Yes |
Show full input schema
{
"type": "object",
"properties": {
"p": {
"enum": [
3,
5
]
},
"matrix": {
"type": "array",
"items": {
"type": "array",
"items": {
"type": "integer",
"minimum": 0,
"maximum": 4
},
"minItems": 1,
"maxItems": 4
},
"minItems": 1,
"maxItems": 4
},
"claim": {
"anyOf": [
{
"type": "object",
"properties": {
"hyperbolic_planes": {
"type": "integer",
"minimum": 0,
"maximum": 4
},
"anisotropic_dimension": {
"type": "integer",
"minimum": 0,
"maximum": 4
},
"radical_dimension": {
"type": "integer",
"minimum": 0,
"maximum": 4
}
},
"required": [
"hyperbolic_planes",
"anisotropic_dimension",
"radical_dimension"
],
"additionalProperties": false
},
{
"type": "null"
}
]
}
},
"required": [
"p",
"matrix",
"claim"
],
"additionalProperties": false
}Published input example
{
"p": 3,
"matrix": [
[
0,
1
],
[
1,
0
]
],
"claim": {
"hyperbolic_planes": 1,
"anisotropic_dimension": 0,
"radical_dimension": 0
}
}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.