Datenvertragswerk
tamari interval tree family
For two ordered full binary trees LOWER and UPPER with the same internal node count 0..4, coded as 0 for a leaf and (LR) for an internal node, reconstructs the entire directed Tamari order interval under the reassociation ((A B) C) -> (A (B C)) at any subtree. Returns every tree code in the interval in ascending ASCII order, the count and comparable. If LOWER cannot reach UPPER the result is an empty list, count 0 and comparable false. No mirror quotient.
POST https://datenvertrag.halowerk.com/v1/tamari-interval-tree-familyInputs
| Field | Type | Required | Description |
|---|---|---|---|
| lower | See schema | Yes | |
| upper | See schema | Yes | |
| claim | See schema | Yes |
Show full input schema
{
"type": "object",
"properties": {
"lower": {
"anyOf": [
{
"type": "string",
"minLength": 1,
"maxLength": 17,
"pattern": "^[0()]+$"
},
{
"type": "null"
}
]
},
"upper": {
"anyOf": [
{
"type": "string",
"minLength": 1,
"maxLength": 17,
"pattern": "^[0()]+$"
},
{
"type": "null"
}
]
},
"claim": {
"anyOf": [
{
"type": "object",
"properties": {
"trees": {
"type": "array",
"items": {
"type": "string",
"minLength": 1,
"maxLength": 17,
"pattern": "^[0()]+$"
},
"minItems": 0,
"maxItems": 14
},
"count": {
"type": "integer",
"minimum": 0,
"maximum": 14
},
"comparable": {
"type": "boolean"
}
},
"required": [
"trees",
"count",
"comparable"
],
"additionalProperties": false
},
{
"type": "null"
}
]
}
},
"required": [
"lower",
"upper",
"claim"
],
"additionalProperties": false
}Published input example
{
"lower": "0",
"upper": "0",
"claim": {
"trees": [
"0"
],
"count": 1,
"comparable": true
}
}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.