Datenvertragswerk
triangle complex shelling order family
From a triangle_mask selecting at most four distinct triangles among the ten lexicographic 3-subsets of labels 0..4 (bit0=012, bit1=013, ., bit9=234), generates every complete facet shelling order of the generated simplicial complex. A permutation F1..Fm is a shelling when for every j>1 the intersection of Fj with the union of all earlier facets is nonempty and pure 1-dimensional. Unused labels add no isolated vertices.
POST https://datenvertrag.halowerk.com/v1/triangle-complex-shelling-order-familyInputs
| Field | Type | Required | Description |
|---|---|---|---|
| triangle_mask | See schema | Yes | |
| claim | See schema | Yes |
Show full input schema
{
"type": "object",
"properties": {
"triangle_mask": {
"anyOf": [
{
"type": "integer",
"minimum": 0,
"maximum": 1023
},
{
"type": "null"
}
]
},
"claim": {
"anyOf": [
{
"type": "object",
"properties": {
"orders": {
"type": "array",
"items": {
"type": "array",
"items": {
"type": "integer",
"minimum": 0,
"maximum": 9
},
"minItems": 0,
"maxItems": 4
},
"minItems": 0,
"maxItems": 24
},
"count": {
"type": "integer",
"minimum": 0,
"maximum": 25
},
"shellable": {
"type": "boolean"
}
},
"required": [
"orders",
"count",
"shellable"
],
"additionalProperties": false
},
{
"type": "null"
}
]
}
},
"required": [
"triangle_mask",
"claim"
],
"additionalProperties": false
}Published input example
{
"triangle_mask": 0,
"claim": {
"orders": [
[]
],
"count": 1,
"shellable": 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.