Datenvertragswerk
semigroup factorization lengths
Given 1..8 distinct positive generators 1..32 with collective gcd 1 and a target 0..128, returns every distinct length (sum of coefficients) of a nonnegative generator-coefficient factorization of that target, sorted ascending, plus delta_set, the sorted distinct positive differences of consecutive lengths. Redundant generators are retained. A gap gives lengths [] and not_observed. Not Apery representatives, Frobenius number, genus or minimum coin count.
POST https://datenvertrag.halowerk.com/v1/semigroup-factorization-lengthsInputs
| Field | Type | Required | Description |
|---|---|---|---|
| generators | See schema | Yes | |
| target | See schema | Yes |
Show full input schema
{
"type": "object",
"properties": {
"generators": {
"anyOf": [
{
"type": "array",
"items": {
"type": "integer",
"minimum": 1,
"maximum": 32
},
"minItems": 1,
"maxItems": 8,
"uniqueItems": true
},
{
"type": "null"
}
]
},
"target": {
"anyOf": [
{
"type": "integer",
"minimum": 0,
"maximum": 128
},
{
"type": "null"
}
]
}
},
"required": [
"generators",
"target"
],
"additionalProperties": false
}Published input example
{
"generators": [
3,
5
],
"target": 15
}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.