Skip to content
HALOWERK

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-set

Inputs

Fields of the published input schema
FieldTypeRequiredDescription
nSee schemaYes
orientation_maskSee schemaYes
claim_sha256See schemaYes
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"
        }
      ]
    }
  }
}

Open original schema

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

All endpoints in this hub โ†’