Datenvertragswerk
binary operator invariant subspace lattice
For a GF(2) linear operator of dimension n in 0..3, given as rows[i] bitmasks (bit j = matrix(i,j)) acting on column vectors, generates every vector subspace U with A(U) a subset of U. Each subspace is a membership mask whose bit v marks vector v. Returns ascending space_masks, aligned dimensions, image_masks of A(U), inclusions[i][j] (Ui subset of Uj) and count. Original coordinates are retained, no basis change or isomorphism quotient.
POST https://datenvertrag.halowerk.com/v1/binary-operator-invariant-subspace-latticeInputs
| Field | Type | Required | Description |
|---|---|---|---|
| rows | See schema | Yes | |
| claim | See schema | Yes |
Show full input schema
{
"type": "object",
"properties": {
"rows": {
"anyOf": [
{
"type": "array",
"items": {
"type": "integer",
"minimum": 0,
"maximum": 7
},
"minItems": 0,
"maxItems": 3
},
{
"type": "null"
}
]
},
"claim": {
"anyOf": [
{
"type": "object",
"properties": {
"space_masks": {
"type": "array",
"items": {
"type": "integer",
"minimum": 1,
"maximum": 255
},
"minItems": 1,
"maxItems": 16
},
"dimensions": {
"type": "array",
"items": {
"type": "integer",
"minimum": 0,
"maximum": 3
},
"minItems": 1,
"maxItems": 16
},
"image_masks": {
"type": "array",
"items": {
"type": "integer",
"minimum": 1,
"maximum": 255
},
"minItems": 1,
"maxItems": 16
},
"inclusions": {
"type": "array",
"items": {
"type": "array",
"items": {
"type": "boolean"
},
"minItems": 1,
"maxItems": 16
},
"minItems": 1,
"maxItems": 16
},
"count": {
"type": "integer",
"minimum": 1,
"maximum": 16
}
},
"required": [
"space_masks",
"dimensions",
"image_masks",
"inclusions",
"count"
],
"additionalProperties": false
},
{
"type": "null"
}
]
}
},
"required": [
"rows",
"claim"
],
"additionalProperties": false
}Published input example
{
"rows": [],
"claim": {
"space_masks": [
1
],
"dimensions": [
0
],
"image_masks": [
1
],
"inclusions": [
[
true
]
],
"count": 1
}
}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.