Skip to content
HALOWERK

Datenvertragswerk

integer polytope decomposition holes

For the three-dimensional Reeve tetrahedron P_m=conv((0,0,0),(1,0,0),(0,1,0),(1,1,m)), m 1..4, and one dilation k 1..3, returns every integer point in kP_m, every distinct sum of k integer points of P_m with its lexicographically least nondecreasing index list, and all holes: lattice points of kP absent from those sums. For example m 2, k 2 has hole (1,1,1). all_decomposable refers only to the supplied k, never to unrestricted normality/IDP.

POST https://datenvertrag.halowerk.com/v1/integer-polytope-decomposition-holes

Inputs

Fields of the published input schema
FieldTypeRequiredDescription
mSee schemaYes
kSee schemaYes
claim_hole_countSee schemaYes
Show full input schema
{
  "type": "object",
  "properties": {
    "m": {
      "anyOf": [
        {
          "type": "integer",
          "minimum": 1,
          "maximum": 4
        },
        {
          "type": "null"
        }
      ]
    },
    "k": {
      "anyOf": [
        {
          "type": "integer",
          "minimum": 1,
          "maximum": 3
        },
        {
          "type": "null"
        }
      ]
    },
    "claim_hole_count": {
      "anyOf": [
        {
          "type": "integer",
          "minimum": 0,
          "maximum": 100
        },
        {
          "type": "null"
        }
      ]
    }
  },
  "required": [
    "m",
    "k",
    "claim_hole_count"
  ],
  "additionalProperties": false
}

Open original schema

Published input example

{
  "m": 2,
  "k": 2,
  "claim_hole_count": 1
}

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