Datenvertragswerk
finite ring module frobenius nakayama witness
Determine whether an explicit finite dimensional unital associative algebra over a finite prime field is Frobenius. Enumerate linear functionals to find the lexicographically first nondegenerate multiplication pairing and compute its Nakayama automorphism with convention lambda(ab)=lambda(b nu(a)); otherwise give a nonzero left radical vector for every functional. This is not finite field Frobenius trace, normal basis, character tables, or linear equation solving alone..
POST https://datenvertrag.halowerk.com/v1/finite-ring-module-frobenius-nakayama-witnessInputs
| Field | Type | Required | Description |
|---|---|---|---|
| prime | See schema | Yes | |
| dimension | See schema | Yes | |
| multiplication | See schema | Yes | |
| claim | See schema | Yes |
Show full input schema
{
"type": "object",
"additionalProperties": false,
"required": [
"prime",
"dimension",
"multiplication",
"claim"
],
"properties": {
"prime": {
"anyOf": [
{
"enum": [
2,
3
]
},
{
"type": "null"
}
]
},
"dimension": {
"anyOf": [
{
"type": "integer",
"minimum": 1,
"maximum": 4
},
{
"type": "null"
}
]
},
"multiplication": {
"anyOf": [
{
"type": "array",
"minItems": 1,
"maxItems": 4,
"items": {
"type": "array",
"minItems": 1,
"maxItems": 4,
"items": {
"type": "array",
"minItems": 1,
"maxItems": 4,
"items": {
"type": "integer",
"minimum": 0,
"maximum": 2
}
}
}
},
{
"type": "null"
}
]
},
"claim": {
"anyOf": [
{
"type": "object",
"additionalProperties": false,
"required": [
"is_frobenius",
"functional",
"gram",
"gram_inverse",
"determinant",
"nakayama",
"earlier_singular_functionals"
],
"properties": {
"is_frobenius": {
"type": "boolean"
},
"functional": {
"anyOf": [
{
"type": "array",
"minItems": 1,
"maxItems": 4,
"items": {
"type": "integer",
"minimum": 0,
"maximum": 2
}
},
{
"type": "null"
}
]
},
"gram": {
"anyOf": [
{
"type": "array",
"minItems": 1,
"maxItems": 4,
"items": {
"type": "array",
"minItems": 1,
"maxItems": 4,
"items": {
"type": "integer",
"minimum": 0,
"maximum": 2
}
}
},
{
"type": "null"
}
]
},
"gram_inverse": {
"anyOf": [
{
"type": "array",
"minItems": 1,
"maxItems": 4,
"items": {
"type": "array",
"minItems": 1,
"maxItems": 4,
"items": {
"type": "integer",
"minimum": 0,
"maximum": 2
}
}
},
{
"type": "null"
}
]
},
"determinant": {
"anyOf": [
{
"type": "integer",
"minimum": 0,
"maximum": 2
},
{
"type": "null"
}
]
},
"nakayama": {
"anyOf": [
{
"type": "array",
"minItems": 1,
"maxItems": 4,
"items": {
"type": "array",
"minItems": 1,
"maxItems": 4,
"items": {
"type": "integer",
"minimum": 0,
"maximum": 2
}
}
},
{
"type": "null"
}
]
},
"earlier_singular_functionals": {
"type": "array",
"minItems": 0,
"maxItems": 81,
"items": {
"type": "object",
"additionalProperties": false,
"required": [
"functional",
"left_radical"
],
"properties": {
"functional": {
"type": "array",
"minItems": 1,
"maxItems": 4,
"items": {
"type": "integer",
"minimum": 0,
"maximum": 2
}
},
"left_radical": {
"type": "array",
"minItems": 1,
"maxItems": 4,
"items": {
"type": "integer",
"minimum": 0,
"maximum": 2
}
}
}
}
}
}
},
{
"type": "null"
}
]
}
}
}Published input example
{
"prime": 2,
"dimension": 1,
"multiplication": [
[
[
1
]
]
],
"claim": {
"is_frobenius": true,
"functional": [
1
],
"gram": [
[
1
]
],
"gram_inverse": [
[
1
]
],
"determinant": 1,
"nakayama": [
[
1
]
],
"earlier_singular_functionals": [
{
"functional": [
0
],
"left_radical": [
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.