Datenvertragswerk
finite even delta matroid twist representability
Given the ENTIRE feasible-set family of an EVEN delta-matroid on original ground labels0..n-1,n0..4, determine actual BINARY REPRESENTABILITY UNDER TWISTS over GF2 and return the canonical forced alternating matrix or a genuine contradictory principal minor. Even means all feasible cardinalities have SAME parity, including all-odd families. Validate nonempty unique ascending feasible masks, ground bounds and full symmetric exchange (u=v toggles ONCE). Choose least numeric feasible mask T;.
POST https://datenvertrag.halowerk.com/v1/finite-even-delta-matroid-twist-representabilityInputs
| Field | Type | Required | Description |
|---|---|---|---|
| ground_size | See schema | Yes | |
| feasible_sets | See schema | Yes | |
| claim_binary | See schema | Yes |
Show full input schema
{
"type": "object",
"additionalProperties": false,
"required": [
"ground_size",
"feasible_sets",
"claim_binary"
],
"properties": {
"ground_size": {
"anyOf": [
{
"type": "integer",
"minimum": 0,
"maximum": 4
},
{
"type": "null"
}
]
},
"feasible_sets": {
"anyOf": [
{
"type": "array",
"minItems": 1,
"maxItems": 16,
"items": {
"type": "integer",
"minimum": 0,
"maximum": 15
}
},
{
"type": "null"
}
]
},
"claim_binary": {
"anyOf": [
{
"type": "boolean"
},
{
"type": "null"
}
]
}
}
}Published input example
{
"ground_size": 2,
"feasible_sets": [
0,
3
],
"claim_binary": 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.