Datenvertragswerk
finite group composition series family
For a fully captured associative group Cayleytable oforder1..6 on original labels0..n-1 with identity0, generate EVERY composition series from{0} to the whole group. Each subgroup is its elementbitmask; each whole chain is ASCENDING by inclusion, both endpoints included. Every consecutive lower subgroup is normal in the next, and no proper intermediate subgroup can refine that step as a subnormal series: successive quotients are simple. Return all chains as series sorted numerically.
POST https://datenvertrag.halowerk.com/v1/finite-group-composition-series-familyInputs
| Field | Type | Required | Description |
|---|---|---|---|
| table | See schema | Yes | |
| claim | See schema | Yes |
Show full input schema
{
"type": "object",
"properties": {
"table": {
"anyOf": [
{
"type": "array",
"items": {
"type": "array",
"items": {
"type": "integer",
"minimum": 0,
"maximum": 5
},
"minItems": 1,
"maxItems": 6
},
"minItems": 1,
"maxItems": 6
},
{
"type": "null"
}
]
},
"claim": {
"anyOf": [
{
"type": "object",
"properties": {
"series": {
"type": "array",
"items": {
"type": "array",
"items": {
"type": "integer",
"minimum": 1,
"maximum": 63
},
"minItems": 1,
"maxItems": 3
},
"minItems": 1,
"maxItems": 3
},
"factor_orders": {
"type": "array",
"items": {
"type": "array",
"items": {
"type": "integer",
"minimum": 2,
"maximum": 6
},
"minItems": 0,
"maxItems": 2
},
"minItems": 1,
"maxItems": 3
},
"count": {
"type": "integer",
"minimum": 1,
"maximum": 3
}
},
"required": [
"series",
"factor_orders",
"count"
],
"additionalProperties": false
},
{
"type": "null"
}
]
}
},
"required": [
"table",
"claim"
],
"additionalProperties": false
}Published input example
{
"table": [
[
0
]
],
"claim": {
"series": [
[
1
]
],
"factor_orders": [
[]
],
"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.