Datenvertragswerk
rational zonotope fine tiling flip graph
Enumerate EVERY fine parallelogram tiling of a planar zonogon from2..4 ordered rational generating vectors, and the ENTIRE elementary3-tile hexagon flip graph. Return exact global vertex coordinates, every used pair/base-mask cell with its4 CCW vertices and area, complete tiling cell-index families, all pairwise tile intersection dimensions/endpoints within each tiling, and every flip with removed/added cells. Distinct tilings are not collapsed by isometry. This is an all-tilings and.
POST https://datenvertrag.halowerk.com/v1/rational-zonotope-fine-tiling-flip-graphInputs
| Field | Type | Required | Description |
|---|---|---|---|
| vectors | See schema | Yes | |
| claim | See schema | Yes |
Show full input schema
{
"type": "object",
"additionalProperties": false,
"required": [
"vectors",
"claim"
],
"properties": {
"vectors": {
"anyOf": [
{
"type": "array",
"minItems": 2,
"maxItems": 4,
"items": {
"type": "array",
"minItems": 2,
"maxItems": 2,
"items": {
"enum": [
"0/1",
"1/2",
"1/1",
"2/1"
]
}
}
},
{
"type": "null"
}
]
},
"claim": {
"anyOf": [
{
"type": "object",
"additionalProperties": false,
"required": [
"vertices",
"cells",
"tilings",
"intersections",
"flip_edges",
"tiling_count",
"area",
"complete"
],
"properties": {
"vertices": {
"type": "array",
"minItems": 4,
"maxItems": 16,
"items": {
"type": "array",
"minItems": 2,
"maxItems": 2,
"items": {
"type": "string",
"maxLength": 8,
"pattern": "^(0|-?[1-9][0-9]*)/[1-9][0-9]*$"
}
}
},
"cells": {
"type": "array",
"minItems": 1,
"maxItems": 24,
"items": {
"type": "object",
"additionalProperties": false,
"required": [
"pair",
"base_mask",
"vertices",
"area"
],
"properties": {
"pair": {
"type": "array",
"minItems": 2,
"maxItems": 2,
"items": {
"type": "integer",
"minimum": 0,
"maximum": 3
}
},
"base_mask": {
"type": "integer",
"minimum": 0,
"maximum": 15
},
"vertices": {
"type": "array",
"minItems": 4,
"maxItems": 4,
"items": {
"type": "integer",
"minimum": 0,
"maximum": 15
}
},
"area": {
"type": "string",
"maxLength": 8,
"pattern": "^(0|-?[1-9][0-9]*)/[1-9][0-9]*$"
}
}
}
},
"tilings": {
"type": "array",
"minItems": 1,
"maxItems": 8,
"items": {
"type": "array",
"minItems": 1,
"maxItems": 6,
"items": {
"type": "integer",
"minimum": 0,
"maximum": 23
}
}
},
"intersections": {
"type": "array",
"minItems": 1,
"maxItems": 8,
"items": {
"type": "array",
"minItems": 0,
"maxItems": 15,
"items": {
"type": "array",
"minItems": 3,
"maxItems": 5,
"items": {
"type": "integer",
"minimum": -1,
"maximum": 23
}
}
}
},
"flip_edges": {
"type": "array",
"minItems": 0,
"maxItems": 8,
"items": {
"type": "object",
"additionalProperties": false,
"required": [
"tilings",
"triple",
"removed",
"added"
],
"properties": {
"tilings": {
"type": "array",
"minItems": 2,
"maxItems": 2,
"items": {
"type": "integer",
"minimum": 0,
"maximum": 7
}
},
"triple": {
"type": "array",
"minItems": 3,
"maxItems": 3,
"items": {
"type": "integer",
"minimum": 0,
"maximum": 3
}
},
"removed": {
"type": "array",
"minItems": 3,
"maxItems": 3,
"items": {
"type": "integer",
"minimum": 0,
"maximum": 23
}
},
"added": {
"type": "array",
"minItems": 3,
"maxItems": 3,
"items": {
"type": "integer",
"minimum": 0,
"maximum": 23
}
}
}
}
},
"tiling_count": {
"type": "integer",
"minimum": 1,
"maximum": 8
},
"area": {
"type": "string",
"maxLength": 8,
"pattern": "^(0|-?[1-9][0-9]*)/[1-9][0-9]*$"
},
"complete": {
"const": true
}
}
},
{
"type": "null"
}
]
}
}
}Published input example
{
"vectors": [
[
"1/1",
"0/1"
],
[
"0/1",
"1/1"
]
],
"claim": 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
- 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.