Datenvertragswerk
minimal ultrametric majorant family
Given one symmetric dissimilarity on n 0..4 labels with off-diagonal entries 1..3, listed as n*(n-1)/2 entries in lexicographic pair order, finds every pointwise-minimal dominating ultrametric with off-diagonal levels 1..3: U(i,j)>=d(i,j) for every pair and U(i,j)<=max(U(i,k),U(k,j)) for every triple. Returns the majorants as upper-triangle vectors in numeric lexicographic order and count. This is the entire Pareto family, not a single least matrix or an L1/L2 fit.
POST https://datenvertrag.halowerk.com/v1/minimal-ultrametric-majorant-familyInputs
| Field | Type | Required | Description |
|---|---|---|---|
| n | See schema | Yes | |
| dissimilarities | See schema | Yes | |
| claim | See schema | Yes |
Show full input schema
{
"type": "object",
"properties": {
"n": {
"anyOf": [
{
"type": "integer",
"minimum": 0,
"maximum": 4
},
{
"type": "null"
}
]
},
"dissimilarities": {
"anyOf": [
{
"type": "array",
"items": {
"type": "integer",
"minimum": 1,
"maximum": 3
},
"minItems": 0,
"maxItems": 6
},
{
"type": "null"
}
]
},
"claim": {
"anyOf": [
{
"type": "object",
"properties": {
"majorants": {
"type": "array",
"items": {
"type": "array",
"items": {
"type": "integer",
"minimum": 1,
"maximum": 3
},
"minItems": 0,
"maxItems": 6
},
"minItems": 0,
"maxItems": 15
},
"count": {
"type": "integer",
"minimum": 0,
"maximum": 16
}
},
"required": [
"majorants",
"count"
],
"additionalProperties": false
},
{
"type": "null"
}
]
}
},
"required": [
"n",
"dissimilarities",
"claim"
],
"additionalProperties": false
}Published input example
{
"n": 0,
"dissimilarities": [],
"claim": {
"majorants": [
[]
],
"count": 1
}
}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.