Datenvertragswerk
finite delta matroid twist width spectrum
For a complete nonempty feasible-set family on ordered ground0..n-1,n0..4, validate Bouchet symmetric exchange: for every feasibleX,Y andu inX symmetric_differenceY, at least onev inthat difference (v=u allowed) makes X symmetric_difference{u,v} feasible. Ifv=u,{u,v} is SINGLETON: toggle once, do not cancel two XOR operations. No binary/normal/even assumption; ordinary matroids included as constant feasible-cardinality cases. For every labelled subsetA construct D*A feasiblefamily={F.
POST https://datenvertrag.halowerk.com/v1/finite-delta-matroid-twist-width-spectrumInputs
| Field | Type | Required | Description |
|---|---|---|---|
| ground_size | See schema | Yes | |
| feasible_masks | See schema | Yes | |
| claim | See schema | Yes |
Show full input schema
{
"type": "object",
"properties": {
"ground_size": {
"anyOf": [
{
"type": "integer",
"minimum": 0,
"maximum": 4
},
{
"type": "null"
}
]
},
"feasible_masks": {
"anyOf": [
{
"type": "array",
"items": {
"type": "integer",
"minimum": 0,
"maximum": 15
},
"minItems": 1,
"maxItems": 16,
"uniqueItems": true
},
{
"type": "null"
}
]
},
"claim": {
"anyOf": [
{
"type": "object",
"properties": {
"twists": {
"type": "array",
"items": {
"type": "object",
"properties": {
"twist_mask": {
"type": "integer",
"minimum": 0,
"maximum": 15
},
"feasible_masks": {
"type": "array",
"items": {
"type": "integer",
"minimum": 0,
"maximum": 15
},
"minItems": 1,
"maxItems": 16,
"uniqueItems": true
},
"minimum_size": {
"type": "integer",
"minimum": 0,
"maximum": 4
},
"maximum_size": {
"type": "integer",
"minimum": 0,
"maximum": 4
},
"width": {
"type": "integer",
"minimum": 0,
"maximum": 4
}
},
"required": [
"twist_mask",
"feasible_masks",
"minimum_size",
"maximum_size",
"width"
],
"additionalProperties": false
},
"minItems": 1,
"maxItems": 16
},
"polynomial": {
"type": "array",
"items": {
"type": "integer",
"minimum": 0,
"maximum": 16
},
"minItems": 1,
"maxItems": 5
}
},
"required": [
"twists",
"polynomial"
],
"additionalProperties": false
},
{
"type": "null"
}
]
}
},
"required": [
"ground_size",
"feasible_masks",
"claim"
],
"additionalProperties": false
}Published input example
{
"ground_size": 2,
"feasible_masks": [
1,
2
],
"claim": {
"twists": [
{
"twist_mask": 0,
"feasible_masks": [
1,
2
],
"minimum_size": 1,
"maximum_size": 1,
"width": 0
},
{
"twist_mask": 1,
"feasible_masks": [
0,
3
],
"minimum_size": 0,
"maximum_size": 2,
"width": 2
},
{
"twist_mask": 2,
"feasible_masks": [
0,
3
],
"minimum_size": 0,
"maximum_size": 2,
"width": 2
},
{
"twist_mask": 3,
"feasible_masks": [
1,
2
],
"minimum_size": 1,
"maximum_size": 1,
"width": 0
}
],
"polynomial": [
2,
0,
2
]
}
}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.