Datenvertragswerk
finite p group jennings restricted lie algebra
From an original finite p-group Cayleytable with identity0 construct the whole graded RESTRICTED Jennings Lie algebra overFp, not only subgroup-series dimensions. prime2or3,order1..9 and a primepower of prime. D_i={g:g-1 belongs to augmentation ideal power I^i}; return EVERY D_i for i1..order, all dimensions of D_i/D_(i+1), and canonical homogeneous basis: increasing degree, greedily choose least original group label independent modulo D_(i+1). Return full basis bracket [g,h]=g^-1 h^-1 g h.
POST https://datenvertrag.halowerk.com/v1/finite-p-group-jennings-restricted-lie-algebraInputs
| Field | Type | Required | Description |
|---|---|---|---|
| prime | See schema | Yes | |
| table | See schema | Yes | |
| claim | See schema | Yes |
Show full input schema
{
"type": "object",
"properties": {
"prime": {
"anyOf": [
{
"enum": [
2,
3
]
},
{
"type": "null"
}
]
},
"table": {
"anyOf": [
{
"type": "array",
"items": {
"type": "array",
"items": {
"type": "integer",
"minimum": 0,
"maximum": 8
},
"minItems": 1,
"maxItems": 9
},
"minItems": 1,
"maxItems": 9
},
{
"type": "null"
}
]
},
"claim": {
"anyOf": [
{
"type": "object",
"properties": {
"dimension_subgroups": {
"type": "array",
"items": {
"type": "array",
"items": {
"type": "integer",
"minimum": 0,
"maximum": 8
},
"minItems": 1,
"maxItems": 9
},
"minItems": 1,
"maxItems": 9
},
"graded_dimensions": {
"type": "array",
"items": {
"type": "integer",
"minimum": 0,
"maximum": 3
},
"minItems": 0,
"maxItems": 8
},
"basis": {
"type": "array",
"items": {
"type": "object",
"properties": {
"degree": {
"type": "integer",
"minimum": 1,
"maximum": 8
},
"representative": {
"type": "integer",
"minimum": 1,
"maximum": 8
}
},
"required": [
"degree",
"representative"
],
"additionalProperties": false
},
"minItems": 0,
"maxItems": 3
},
"bracket": {
"type": "array",
"items": {
"type": "array",
"items": {
"type": "integer",
"minimum": 0,
"maximum": 8
},
"minItems": 0,
"maxItems": 3
},
"minItems": 0,
"maxItems": 3
},
"pmap": {
"type": "array",
"items": {
"type": "integer",
"minimum": 0,
"maximum": 8
},
"minItems": 1,
"maxItems": 9
},
"augmentation_nilpotency_index": {
"type": "integer",
"minimum": 1,
"maximum": 9
}
},
"required": [
"dimension_subgroups",
"graded_dimensions",
"basis",
"bracket",
"pmap",
"augmentation_nilpotency_index"
],
"additionalProperties": false
},
{
"type": "null"
}
]
}
},
"required": [
"prime",
"table",
"claim"
],
"additionalProperties": false
}Published input example
{
"prime": 2,
"table": [
[
0,
1,
2,
3,
4,
5,
6,
7
],
[
1,
4,
3,
6,
5,
0,
7,
2
],
[
2,
7,
0,
5,
6,
3,
4,
1
],
[
3,
2,
1,
0,
7,
6,
5,
4
],
[
4,
5,
6,
7,
0,
1,
2,
3
],
[
5,
0,
7,
2,
1,
4,
3,
6
],
[
6,
3,
4,
1,
2,
7,
0,
5
],
[
7,
6,
5,
4,
3,
2,
1,
0
]
],
"claim": null
}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.