Datenvertragswerk
ordered matroid nbc set family
For a binary column matroid with dimension 0..2 and columns 0..4 indexed 0..m-1, where columns[j] is a GF2 column vector bitmask below 2^dimension and ordering is a permutation of column labels (earliest entry smallest), reconstructs all inclusion-minimal linearly dependent circuit_masks, the aligned broken_masks (each circuit without its smallest label under the caller ordering) and every no-broken-circuit subset nbc_masks. Also returns size_histogram and count.
POST https://datenvertrag.halowerk.com/v1/ordered-matroid-nbc-set-familyInputs
| Field | Type | Required | Description |
|---|---|---|---|
| dimension | See schema | Yes | |
| columns | See schema | Yes | |
| ordering | See schema | Yes | |
| claim | See schema | Yes |
Show full input schema
{
"type": "object",
"properties": {
"dimension": {
"anyOf": [
{
"type": "integer",
"minimum": 0,
"maximum": 2
},
{
"type": "null"
}
]
},
"columns": {
"anyOf": [
{
"type": "array",
"items": {
"type": "integer",
"minimum": 0,
"maximum": 3
},
"minItems": 0,
"maxItems": 4
},
{
"type": "null"
}
]
},
"ordering": {
"anyOf": [
{
"type": "array",
"items": {
"type": "integer",
"minimum": 0,
"maximum": 3
},
"minItems": 0,
"maxItems": 4
},
{
"type": "null"
}
]
},
"claim": {
"anyOf": [
{
"type": "object",
"properties": {
"circuit_masks": {
"type": "array",
"items": {
"type": "integer",
"minimum": 1,
"maximum": 15
},
"minItems": 0,
"maxItems": 15
},
"broken_masks": {
"type": "array",
"items": {
"type": "integer",
"minimum": 0,
"maximum": 15
},
"minItems": 0,
"maxItems": 15
},
"nbc_masks": {
"type": "array",
"items": {
"type": "integer",
"minimum": 0,
"maximum": 15
},
"minItems": 0,
"maxItems": 16
},
"size_histogram": {
"type": "array",
"items": {
"type": "integer",
"minimum": 0,
"maximum": 16
},
"minItems": 1,
"maxItems": 5
},
"count": {
"type": "integer",
"minimum": 0,
"maximum": 17
}
},
"required": [
"circuit_masks",
"broken_masks",
"nbc_masks",
"size_histogram",
"count"
],
"additionalProperties": false
},
{
"type": "null"
}
]
}
},
"required": [
"dimension",
"columns",
"ordering",
"claim"
],
"additionalProperties": false
}Published input example
{
"dimension": 0,
"columns": [],
"ordering": [],
"claim": {
"circuit_masks": [],
"broken_masks": [],
"nbc_masks": [
0
],
"size_histogram": [
1
],
"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.