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-inventoryInputs
| Field | Type | Required | Description |
|---|---|---|---|
| n | integer | Yes | |
| rank_table | See schema | Yes |
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
}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
- 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.