Datenvertragswerk
consecutive ones column order family
For one indexed binary matrix with 0..4 columns (labels 0..columns-1) and 0..3 rows, reconstructs every column permutation for which the ones in each row occupy one contiguous linear block. row_masks[i] bit j is the cell (row i, column j). Returns orders in numeric lexicographic order, intervals[orderindex][originalrowindex]=[start,end_exclusive], count and feasible=(count>0). A row with no ones has the interval [0,0]; no admissible order is a known empty family.
POST https://datenvertrag.halowerk.com/v1/consecutive-ones-column-order-familyInputs
| Field | Type | Required | Description |
|---|---|---|---|
| columns | See schema | Yes | |
| row_masks | See schema | Yes | |
| claim | See schema | Yes |
Show full input schema
{
"type": "object",
"properties": {
"columns": {
"anyOf": [
{
"type": "integer",
"minimum": 0,
"maximum": 4
},
{
"type": "null"
}
]
},
"row_masks": {
"anyOf": [
{
"type": "array",
"items": {
"type": "integer",
"minimum": 0,
"maximum": 15
},
"minItems": 0,
"maxItems": 3
},
{
"type": "null"
}
]
},
"claim": {
"anyOf": [
{
"type": "object",
"properties": {
"orders": {
"type": "array",
"items": {
"type": "array",
"items": {
"type": "integer",
"minimum": 0,
"maximum": 3
},
"minItems": 0,
"maxItems": 4
},
"minItems": 0,
"maxItems": 32
},
"intervals": {
"type": "array",
"items": {
"type": "array",
"items": {
"type": "array",
"items": {
"type": "integer",
"minimum": 0,
"maximum": 4
},
"minItems": 2,
"maxItems": 2
},
"minItems": 0,
"maxItems": 3
},
"minItems": 0,
"maxItems": 32
},
"count": {
"type": "integer",
"minimum": 0,
"maximum": 32
},
"feasible": {
"type": "boolean"
}
},
"required": [
"orders",
"intervals",
"count",
"feasible"
],
"additionalProperties": false
},
{
"type": "null"
}
]
}
},
"required": [
"columns",
"row_masks",
"claim"
],
"additionalProperties": false
}Published input example
{
"columns": 0,
"row_masks": [],
"claim": {
"orders": [
[]
],
"intervals": [
[]
],
"count": 1,
"feasible": true
}
}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.