Datenvertragswerk
minimum boolean factorization family
For one binary matrix with rows 0..3, cols 0..3 and matrix_mask bit (i*cols+j)=A[i,j], computes the exact Boolean rank and every minimum exact Boolean factorization. The Boolean product uses OR of ANDs, not addition over reals/GF2. Each rank-one component is [row_mask, col_mask], both nonempty; the OR union of all components must equal all and only the original 1 cells, and overlap is allowed. Returns boolean_rank, factorizations and count.
POST https://datenvertrag.halowerk.com/v1/minimum-boolean-factorization-familyInputs
| Field | Type | Required | Description |
|---|---|---|---|
| rows | See schema | Yes | |
| cols | See schema | Yes | |
| matrix_mask | See schema | Yes | |
| claim | See schema | Yes |
Show full input schema
{
"type": "object",
"properties": {
"rows": {
"anyOf": [
{
"type": "integer",
"minimum": 0,
"maximum": 3
},
{
"type": "null"
}
]
},
"cols": {
"anyOf": [
{
"type": "integer",
"minimum": 0,
"maximum": 3
},
{
"type": "null"
}
]
},
"matrix_mask": {
"anyOf": [
{
"type": "integer",
"minimum": 0,
"maximum": 511
},
{
"type": "null"
}
]
},
"claim": {
"anyOf": [
{
"type": "object",
"properties": {
"boolean_rank": {
"type": "integer",
"minimum": 0,
"maximum": 4
},
"factorizations": {
"type": "array",
"items": {
"type": "array",
"items": {
"type": "array",
"items": {
"type": "integer",
"minimum": 1,
"maximum": 7
},
"minItems": 2,
"maxItems": 2
},
"minItems": 0,
"maxItems": 3
},
"minItems": 0,
"maxItems": 32
},
"count": {
"type": "integer",
"minimum": 0,
"maximum": 33
}
},
"required": [
"boolean_rank",
"factorizations",
"count"
],
"additionalProperties": false
},
{
"type": "null"
}
]
}
},
"required": [
"rows",
"cols",
"matrix_mask",
"claim"
],
"additionalProperties": false
}Published input example
{
"rows": 0,
"cols": 0,
"matrix_mask": 0,
"claim": {
"boolean_rank": 0,
"factorizations": [
[]
],
"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.