Skip to content
HALOWERK

Datenvertragswerk

polymatroid base vertex inventory

From a complete integer polymatroid rank table f on labels 0..n-1 (n 0..4, ranks 0..6, length exactly 2^n, rank_table[mask] with bit i for element i), validates f(empty)=0, monotonicity and submodularity and returns every distinct vertex of the base polytope x>=0, sum_E x=f(E), sum_S x<=f(S), sorted lexicographically, each with all its tight subset masks. No real arithmetic approximation; invalid known tables raise HTTP 400.

POST https://datenvertrag.halowerk.com/v1/polymatroid-base-vertex-inventory

Inputs

Fields of the published input schema
FieldTypeRequiredDescription
nintegerYes
rank_tableSee schemaYes
Show full input schema
{
  "type": "object",
  "properties": {
    "n": {
      "type": "integer",
      "minimum": 0,
      "maximum": 4
    },
    "rank_table": {
      "anyOf": [
        {
          "type": "array",
          "minItems": 1,
          "maxItems": 16,
          "items": {
            "type": "integer",
            "minimum": 0,
            "maximum": 6
          }
        },
        {
          "type": "null"
        }
      ]
    }
  },
  "required": [
    "n",
    "rank_table"
  ],
  "additionalProperties": false
}

Open original schema

Published input example

{
  "n": 2,
  "rank_table": [
    0,
    2,
    1,
    3
  ]
}

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 โ†’