Datenvertragswerk
finite field tensor stabilizer orbit
Full GL2(F2)^3 orbit and original-basis isotropy inventory of a2x2x2F2tensor, codebit4i+2j+k. Action Tprime_ijk=sum_abc A_ia B_jb C_kc T_abc mod2. Enumerate all216productelements, noaxispermutations oroutputcomplement. Return every sortedorbitcode, numericminimum, least transporter foreachpoint, originalstabilizer and the COMPLETE stabilizer of EVERY orbitpoint. LocalGLcodes[6,7,9,11,13,14] use matrixbit2row+column; productgroupindices0..215 scanA,B,C lexicographically,Cfastest. Fixed54hex.
POST https://datenvertrag.halowerk.com/v1/finite-field-tensor-stabilizer-orbitInputs
| Field | Type | Required | Description |
|---|---|---|---|
| tensor | See schema | Yes | |
| claim | See schema | Yes |
Show full input schema
{
"type": "object",
"properties": {
"tensor": {
"anyOf": [
{
"type": "array",
"items": {
"type": "integer",
"minimum": 0,
"maximum": 1
},
"minItems": 8,
"maxItems": 8
},
{
"type": "null"
}
]
},
"claim": {
"anyOf": [
{
"type": "object",
"properties": {
"field": {
"const": 2
},
"shape": {
"const": [
2,
2,
2
]
},
"tensor_entries": {
"type": "array",
"items": {
"type": "integer",
"minimum": 0,
"maximum": 1
},
"minItems": 8,
"maxItems": 8
},
"local_GL_codes": {
"const": [
6,
7,
9,
11,
13,
14
]
},
"group_order": {
"const": 216
},
"orbit_codes": {
"type": "array",
"items": {
"type": "integer",
"minimum": 0,
"maximum": 255
},
"minItems": 1,
"maxItems": 216
},
"orbit_size": {
"type": "integer",
"minimum": 1,
"maximum": 216
},
"canonical_code": {
"type": "integer",
"minimum": 0,
"maximum": 255
},
"transporter_indices": {
"type": "array",
"items": {
"type": "integer",
"minimum": 0,
"maximum": 215
},
"minItems": 1,
"maxItems": 216
},
"original_stabilizer_mask": {
"type": "string",
"pattern": "^0x[0-9a-f]{54}$",
"minLength": 56,
"maxLength": 56
},
"stabilizer_order": {
"type": "integer",
"minimum": 1,
"maximum": 216
},
"point_isotropy_masks": {
"type": "array",
"items": {
"type": "string",
"pattern": "^0x[0-9a-f]{54}$",
"minLength": 56,
"maxLength": 56
},
"minItems": 1,
"maxItems": 216
},
"complete_inventory": {
"const": true
}
},
"required": [
"field",
"shape",
"tensor_entries",
"local_GL_codes",
"group_order",
"orbit_codes",
"orbit_size",
"canonical_code",
"transporter_indices",
"original_stabilizer_mask",
"stabilizer_order",
"point_isotropy_masks",
"complete_inventory"
],
"additionalProperties": false
},
{
"type": "null"
}
]
}
},
"required": [
"tensor",
"claim"
],
"additionalProperties": false
}Published input example
{
"tensor": [
1,
1,
1,
1,
1,
1,
1,
1
],
"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.