Datenvertragswerk
finite semigroup irreducible representation characters
For an original labelled finite MONOID of order1..3, identity0, return ALL unital complex irreducible characters, their dimensions and regular-composition multiplicities; exact regular trace Gram matrix and full rational Jacobson radical basis/power dimensions. table[i][j]=i*j; square, closed, associative with two-sided identity0. Character entries use codes0=0,1=1,2=-1,3=omega,4=omega^2, omega=exp(2pi*i/3); rows sorted lexicographically by code. All simple dimensions1 follows from.
POST https://datenvertrag.halowerk.com/v1/finite-semigroup-irreducible-representation-charactersInputs
| Field | Type | Required | Description |
|---|---|---|---|
| monoid | See schema | Yes | |
| claim | See schema | Yes |
Show full input schema
{
"type": "object",
"properties": {
"monoid": {
"anyOf": [
{
"type": "object",
"properties": {
"table": {
"type": "array",
"items": {
"type": "array",
"items": {
"type": "integer",
"minimum": 0,
"maximum": 2
},
"minItems": 1,
"maxItems": 3
},
"minItems": 1,
"maxItems": 3
}
},
"required": [
"table"
],
"additionalProperties": false
},
{
"type": "null"
}
]
},
"claim": {
"anyOf": [
{
"type": "object",
"properties": {
"monoid_order": {
"type": "integer",
"minimum": 1,
"maximum": 3
},
"irreducible_characters": {
"type": "array",
"items": {
"type": "array",
"items": {
"type": "integer",
"minimum": 0,
"maximum": 4
},
"minItems": 1,
"maxItems": 3
},
"minItems": 1,
"maxItems": 3
},
"irreducible_dimensions": {
"type": "array",
"items": {
"const": 1,
"type": "integer"
},
"minItems": 1,
"maxItems": 3
},
"regular_character": {
"type": "array",
"items": {
"type": "integer",
"minimum": 0,
"maximum": 3
},
"minItems": 1,
"maxItems": 3
},
"regular_composition_multiplicities": {
"type": "array",
"items": {
"type": "integer",
"minimum": 1,
"maximum": 3
},
"minItems": 1,
"maxItems": 3
},
"regular_trace_gram": {
"type": "array",
"items": {
"type": "array",
"items": {
"type": "integer",
"minimum": 0,
"maximum": 3
},
"minItems": 1,
"maxItems": 3
},
"minItems": 1,
"maxItems": 3
},
"jacobson_radical_basis": {
"type": "array",
"items": {
"type": "array",
"items": {
"type": "string",
"pattern": "^-?(0|[1-9])/[1-9]$",
"maxLength": 4
},
"minItems": 1,
"maxItems": 3
},
"minItems": 0,
"maxItems": 1
},
"radical_power_dimensions": {
"type": "array",
"items": {
"type": "integer",
"minimum": 0,
"maximum": 1
},
"minItems": 1,
"maxItems": 2
},
"radical_nilpotency_index": {
"type": "integer",
"minimum": 1,
"maximum": 2
},
"regular_module_semisimple": {
"type": "boolean"
}
},
"required": [
"monoid_order",
"irreducible_characters",
"irreducible_dimensions",
"regular_character",
"regular_composition_multiplicities",
"regular_trace_gram",
"jacobson_radical_basis",
"radical_power_dimensions",
"radical_nilpotency_index",
"regular_module_semisimple"
],
"additionalProperties": false
},
{
"type": "null"
}
]
}
},
"required": [
"monoid",
"claim"
],
"additionalProperties": false
}Published input example
{
"monoid": {
"table": [
[
0,
1,
2
],
[
1,
1,
1
],
[
2,
2,
2
]
]
},
"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.