Datenvertragswerk
finite lattice canonical join complex
Given the complete boolean order relation on 1..6 labels, derives join/meet tables, join-irreducibles and every element's canonical join representation: the unique lowest irredundant antichain under universal join refinement. Returns all minimal refinement candidate antichains per element, complete faces and inclusion-maximal facets, and the lex-first [x,y,z] violating x∨y=x∨z => x∨(y∧z)=x∨y. If the lattice is not join-semidistributive, faces and facets are null.
POST https://datenvertrag.halowerk.com/v1/finite-lattice-canonical-join-complexInputs
| Field | Type | Required | Description |
|---|---|---|---|
| order | See schema | Yes | |
| claim_faces | See schema | Yes |
Show full input schema
{
"type": "object",
"properties": {
"order": {
"anyOf": [
{
"type": "array",
"items": {
"type": "array",
"items": {
"type": "boolean"
},
"minItems": 1,
"maxItems": 6
},
"minItems": 1,
"maxItems": 6
},
{
"type": "null"
}
]
},
"claim_faces": {
"anyOf": [
{
"type": "array",
"items": {
"type": "array",
"items": {
"type": "integer",
"minimum": 0,
"maximum": 5
},
"minItems": 0,
"maxItems": 6
},
"minItems": 0,
"maxItems": 64
},
{
"type": "null"
}
]
}
},
"required": [
"order",
"claim_faces"
],
"additionalProperties": false
}Published input example
{
"order": [
[
true,
true,
true
],
[
false,
true,
true
],
[
false,
false,
true
]
],
"claim_faces": [
[],
[
1
],
[
2
]
]
}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.