Datenvertragswerk
exponential bell sequence prefix
Compute the complete exponential Bell transform of a captured signed sequence a1,.,aN. The output b1,.,bN is defined by exp(sum(a_k*x^k/k!, k=1..N)) = 1 + sum(b_n*x^n/n!, n=1..N) through the captured degree N. Equivalently, b_n is the sum over all set partitions of n labelled elements of the product of a_(block size) over their blocks. For example, [1,1,1] maps to [1,2,5], and [1,0,0] maps to [1,1,1]. This is the complete exponential convention, corresponding to SageMath bell_polynomial.
POST https://datenvertrag.halowerk.com/v1/exponential-bell-sequence-prefixInputs
| Field | Type | Required | Description |
|---|---|---|---|
| prefix | See schema | Yes | |
| claim | See schema | Yes |
Show full input schema
{
"type": "object",
"properties": {
"prefix": {
"anyOf": [
{
"type": "array",
"items": {
"type": "integer",
"minimum": -1,
"maximum": 1
},
"minItems": 0,
"maxItems": 7
},
{
"type": "null"
}
]
},
"claim": {
"anyOf": [
{
"type": "array",
"items": {
"type": "integer",
"minimum": -1000,
"maximum": 1000
},
"minItems": 0,
"maxItems": 7
},
{
"type": "null"
}
]
}
},
"required": [
"prefix",
"claim"
],
"additionalProperties": false
}Published input example
{
"prefix": [],
"claim": []
}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.