Datenvertragswerk
finite poset p partition fundamental expansion
Construct the COMPLETE fundamental quasisymmetric expansion of the labelled-poset P-partition enumerator for n0..4. Original vertices0..n-1, entire strict transitive Boolean relationmatrix, labels a permutation1..n. Use the ORDER-PRESERVING convention in official Sage p_partition_enumerator: a<_P b implies f(a)<=f(b), strict when labels[a]>labels[b]. Positive colours; monomial weight product_v x_f(v). F_(n,D) sums weakly increasing index words with strictness at D. Return all nonzero integer.
POST https://datenvertrag.halowerk.com/v1/finite-poset-p-partition-fundamental-expansionInputs
| Field | Type | Required | Description |
|---|---|---|---|
| relations | See schema | Yes | |
| labels | See schema | Yes | |
| claim | See schema | No |
Show full input schema
{
"type": "object",
"properties": {
"relations": {
"anyOf": [
{
"type": "array",
"items": {
"type": "array",
"items": {
"type": "boolean"
},
"maxItems": 4,
"minItems": 0
},
"maxItems": 4,
"minItems": 0
},
{
"type": "null"
}
]
},
"labels": {
"anyOf": [
{
"type": "array",
"items": {
"type": "integer",
"minimum": 1,
"maximum": 4
},
"maxItems": 4,
"minItems": 0,
"uniqueItems": true
},
{
"type": "null"
}
]
},
"claim": {
"anyOf": [
{
"type": "array",
"items": {
"type": "object",
"properties": {
"descent_mask": {
"type": "integer",
"minimum": 0,
"maximum": 7
},
"descent_set": {
"type": "array",
"items": {
"type": "integer",
"minimum": 1,
"maximum": 3
},
"maxItems": 3,
"minItems": 0
},
"composition": {
"type": "array",
"items": {
"type": "integer",
"minimum": 1,
"maximum": 4
},
"maxItems": 4,
"minItems": 0
},
"coefficient": {
"type": "integer",
"minimum": 1,
"maximum": 24
}
},
"required": [
"descent_mask",
"descent_set",
"composition",
"coefficient"
],
"additionalProperties": false
},
"maxItems": 8,
"minItems": 0
},
{
"type": "null"
}
]
}
},
"required": [
"relations",
"labels"
],
"additionalProperties": false
}Published input example
{
"relations": [
[
false,
false,
true
],
[
false,
false,
true
],
[
false,
false,
false
]
],
"labels": [
1,
2,
3
]
}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.