Datenvertragswerk
permutation group molien prefix
For a COMPLETE supplied finite permutation group G acting on n=1..4 variables by permutation over Q, return all invariant-ring Hilbert dimensions h0..hD through D=0..8. Molien formula M(t)=average_g product over disjoint cycles c of (1-t^length(c))^-1. Include fixed points as1cycles. All arithmetic exact integer; return full ordered coefficient vector with h0=1. Validate every element as a permutation of0..n-1, identity, no duplicates and closure for all products; caller must supply the.
POST https://datenvertrag.halowerk.com/v1/permutation-group-molien-prefixInputs
| Field | Type | Required | Description |
|---|---|---|---|
| n | integer | Yes | |
| elements | See schema | Yes | |
| max_degree | integer | Yes | |
| claim | See schema | Yes |
Show full input schema
{
"type": "object",
"properties": {
"n": {
"type": "integer",
"minimum": 1,
"maximum": 4
},
"elements": {
"anyOf": [
{
"type": "array",
"items": {
"type": "array",
"items": {
"type": "integer",
"minimum": 0,
"maximum": 3
},
"minItems": 1,
"maxItems": 4,
"uniqueItems": true
},
"minItems": 1,
"maxItems": 24,
"uniqueItems": true
},
{
"type": "null"
}
]
},
"max_degree": {
"type": "integer",
"minimum": 0,
"maximum": 8
},
"claim": {
"anyOf": [
{
"type": "array",
"items": {
"type": "integer",
"minimum": 0,
"maximum": 165
},
"minItems": 1,
"maxItems": 9
},
{
"type": "null"
}
]
}
},
"required": [
"n",
"elements",
"max_degree",
"claim"
],
"additionalProperties": false
}Published input example
{
"n": 2,
"elements": [
[
0,
1
]
],
"max_degree": 4,
"claim": [
1,
2,
3,
4,
5
]
}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.