Datenvertragswerk
rational polygon ehrhart quasipolynomial family
For a fully supplied rational convex planar polygon compute its ENTIRE Ehrhart lattice-point quasipolynomial: all residue constituent degree-two polynomials, exact denominator period and least quasipolynomial period including period collapse. This counts ALL integer dilations by theorem, not just lattice points for one dilation, an Ehrhart finite prefix, cone Hilbert basis, a Hilbert series for a monomial ideal, or numeric interpolation without a global Ehrhart proof. Exact profile:3or4.
POST https://datenvertrag.halowerk.com/v1/rational-polygon-ehrhart-quasipolynomial-familyInputs
| Field | Type | Required | Description |
|---|---|---|---|
| vertices_twice | See schema | Yes | |
| claim | See schema | Yes |
Show full input schema
{
"type": "object",
"additionalProperties": false,
"required": [
"vertices_twice",
"claim"
],
"properties": {
"vertices_twice": {
"anyOf": [
{
"type": "array",
"minItems": 3,
"maxItems": 4,
"items": {
"type": "array",
"minItems": 2,
"maxItems": 2,
"items": {
"type": "integer",
"minimum": -4,
"maximum": 4
}
}
},
{
"type": "null"
}
]
},
"claim": {
"anyOf": [
{
"type": "object",
"additionalProperties": false,
"required": [
"denominator",
"least_period",
"constituents"
],
"properties": {
"denominator": {
"type": "integer",
"minimum": 1,
"maximum": 2
},
"least_period": {
"type": "integer",
"minimum": 1,
"maximum": 2
},
"constituents": {
"type": "array",
"minItems": 1,
"maxItems": 2,
"items": {
"type": "array",
"minItems": 3,
"maxItems": 3,
"items": {
"type": "string",
"pattern": "^-?(0|[1-9][0-9]{0,4})/[1-8]$",
"maxLength": 8
}
}
}
}
},
{
"type": "null"
}
]
}
}
}Published input example
{
"vertices_twice": [
[
0,
0
],
[
1,
0
],
[
0,
1
]
],
"claim": {
"denominator": 2,
"least_period": 2,
"constituents": [
[
"1/1",
"3/4",
"1/8"
],
[
"3/8",
"1/2",
"1/8"
]
]
}
}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.