Datenvertragswerk
tournament banks maximal transitive choice set
Constructs the Banks choice set of a complete tournament on labels 0..n-1 (n 1..5): the tops of all inclusion-maximal transitive subtournaments (Brandt/Grundbacher Section 2). Input is orientation_mask, where bit 1 means the lower label dominates the higher for lex unordered pairs. Returns the entire maximal subset family, each unique dominance order and top, and a directed 3-cycle for every blocked one-vertex extension. Not Copeland scores or Slater orders.
POST https://datenvertrag.halowerk.com/v1/tournament-banks-maximal-transitive-choice-setInputs
| Field | Type | Required | Description |
|---|---|---|---|
| n | See schema | Yes | |
| orientation_mask | See schema | Yes | |
| claim_sha256 | See schema | Yes |
Show full input schema
{
"type": "object",
"additionalProperties": false,
"required": [
"n",
"orientation_mask",
"claim_sha256"
],
"properties": {
"n": {
"anyOf": [
{
"type": "integer",
"minimum": 1,
"maximum": 5
},
{
"type": "null"
}
]
},
"orientation_mask": {
"anyOf": [
{
"type": "integer",
"minimum": 0,
"maximum": 1023
},
{
"type": "null"
}
]
},
"claim_sha256": {
"anyOf": [
{
"type": "string",
"pattern": "^[0-9a-f]{64}$",
"minLength": 64,
"maxLength": 64
},
{
"type": "null"
}
]
}
}
}Published input example
{
"n": 4,
"orientation_mask": 63,
"claim_sha256": null
}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.