Datenvertragswerk
finite permutation module indecomposable splitting
For original permutation generators of a subgroup of S_n (n1..3,0..3generators) acting on F_p^n (p2or3), construct ONE canonical complete indecomposable direct-sum splitting of the ORIGINAL module. Return full endomorphism-ring linear basis, a complete sorted orthogonal primitive projector system summing to identity, each actual image RREF row basis in original coordinates, and restricted matrices of every supplied generator. Permutations send column basis e_i to e_g(i); row-major matrix.
POST https://datenvertrag.halowerk.com/v1/finite-permutation-module-indecomposable-splittingInputs
| Field | Type | Required | Description |
|---|---|---|---|
| field | See schema | Yes | |
| dimension | See schema | Yes | |
| generators | See schema | Yes | |
| claim | See schema | Yes |
Show full input schema
{
"type": "object",
"additionalProperties": false,
"properties": {
"field": {
"anyOf": [
{
"enum": [
2,
3
]
},
{
"type": "null"
}
]
},
"dimension": {
"anyOf": [
{
"type": "integer",
"minimum": 1,
"maximum": 3
},
{
"type": "null"
}
]
},
"generators": {
"anyOf": [
{
"type": "array",
"items": {
"type": "array",
"items": {
"type": "integer",
"minimum": 0,
"maximum": 2
},
"minItems": 1,
"maxItems": 3
},
"minItems": 0,
"maxItems": 3
},
{
"type": "null"
}
]
},
"claim": {
"anyOf": [
{
"type": "object",
"additionalProperties": false,
"properties": {
"endomorphism_basis_codes": {
"type": "array",
"items": {
"type": "integer",
"minimum": 1,
"maximum": 19682
},
"minItems": 1,
"maxItems": 9
},
"primitive_projector_codes": {
"type": "array",
"items": {
"type": "integer",
"minimum": 1,
"maximum": 19682
},
"minItems": 1,
"maxItems": 3
},
"summands": {
"type": "array",
"items": {
"type": "object",
"additionalProperties": false,
"properties": {
"dimension": {
"type": "integer",
"minimum": 1,
"maximum": 3
},
"image_basis": {
"type": "array",
"items": {
"type": "array",
"items": {
"type": "integer",
"minimum": 0,
"maximum": 2
},
"minItems": 1,
"maxItems": 3
},
"minItems": 1,
"maxItems": 3
},
"generator_matrices": {
"type": "array",
"items": {
"type": "array",
"items": {
"type": "integer",
"minimum": 0,
"maximum": 2
},
"minItems": 1,
"maxItems": 9
},
"minItems": 0,
"maxItems": 3
}
},
"required": [
"dimension",
"image_basis",
"generator_matrices"
]
},
"minItems": 1,
"maxItems": 3
},
"complete": {
"const": true
}
},
"required": [
"endomorphism_basis_codes",
"primitive_projector_codes",
"summands",
"complete"
]
},
{
"type": "null"
}
]
}
},
"required": [
"field",
"dimension",
"generators",
"claim"
]
}Published input example
{
"field": 2,
"dimension": 2,
"generators": [
[
1,
0
]
],
"claim": {
"endomorphism_basis_codes": [
9,
6
],
"primitive_projector_codes": [
9
],
"summands": [
{
"dimension": 2,
"image_basis": [
[
1,
0
],
[
0,
1
]
],
"generator_matrices": [
[
0,
1,
1,
0
]
]
}
],
"complete": true
}
}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.