Datenvertragswerk
finite group biset tensor product decomposition
Compose two finite bisets U(G,H) and V(H,K) over the shared group H into the balanced tensor product U x_H V. Input: Cayley tables of G, H, K (order 1..6) and the four action tables; group laws and commuting actions are validated. Returns all H-orbit classes of raw pairs, the induced left G and right K actions on class indices and every GxK-orbit with least representative, points, stabilizer pairs, projections, kernels and Goursat coset correspondence. Exact finite computation, 0.003 USDC.
POST https://datenvertrag.halowerk.com/v1/finite-group-biset-tensor-product-decompositionInputs
| Field | Type | Required | Description |
|---|---|---|---|
| g_table | See schema | Yes | |
| h_table | See schema | Yes | |
| k_table | See schema | Yes | |
| u_size | See schema | Yes | |
| v_size | See schema | Yes | |
| u_left | See schema | Yes | |
| u_right | See schema | Yes | |
| v_left | See schema | Yes | |
| v_right | See schema | Yes | |
| claim | See schema | Yes |
Show full input schema
{
"type": "object",
"properties": {
"g_table": {
"anyOf": [
{
"type": "array",
"items": {
"type": "array",
"items": {
"type": "integer",
"minimum": 0,
"maximum": 5
},
"minItems": 1,
"maxItems": 6
},
"minItems": 1,
"maxItems": 6
},
{
"type": "null"
}
]
},
"h_table": {
"anyOf": [
{
"type": "array",
"items": {
"type": "array",
"items": {
"type": "integer",
"minimum": 0,
"maximum": 5
},
"minItems": 1,
"maxItems": 6
},
"minItems": 1,
"maxItems": 6
},
{
"type": "null"
}
]
},
"k_table": {
"anyOf": [
{
"type": "array",
"items": {
"type": "array",
"items": {
"type": "integer",
"minimum": 0,
"maximum": 5
},
"minItems": 1,
"maxItems": 6
},
"minItems": 1,
"maxItems": 6
},
{
"type": "null"
}
]
},
"u_size": {
"anyOf": [
{
"type": "integer",
"minimum": 0,
"maximum": 4
},
{
"type": "null"
}
]
},
"v_size": {
"anyOf": [
{
"type": "integer",
"minimum": 0,
"maximum": 4
},
{
"type": "null"
}
]
},
"u_left": {
"anyOf": [
{
"type": "array",
"items": {
"type": "array",
"items": {
"type": "integer",
"minimum": 0,
"maximum": 3
},
"minItems": 0,
"maxItems": 4
},
"minItems": 1,
"maxItems": 6
},
{
"type": "null"
}
]
},
"u_right": {
"anyOf": [
{
"type": "array",
"items": {
"type": "array",
"items": {
"type": "integer",
"minimum": 0,
"maximum": 3
},
"minItems": 0,
"maxItems": 4
},
"minItems": 1,
"maxItems": 6
},
{
"type": "null"
}
]
},
"v_left": {
"anyOf": [
{
"type": "array",
"items": {
"type": "array",
"items": {
"type": "integer",
"minimum": 0,
"maximum": 3
},
"minItems": 0,
"maxItems": 4
},
"minItems": 1,
"maxItems": 6
},
{
"type": "null"
}
]
},
"v_right": {
"anyOf": [
{
"type": "array",
"items": {
"type": "array",
"items": {
"type": "integer",
"minimum": 0,
"maximum": 3
},
"minItems": 0,
"maxItems": 4
},
"minItems": 1,
"maxItems": 6
},
{
"type": "null"
}
]
},
"claim": {
"anyOf": [
{
"type": "object",
"properties": {
"classes": {
"type": "array",
"items": {
"type": "array",
"items": {
"type": "integer",
"minimum": 0,
"maximum": 15
},
"minItems": 1,
"maxItems": 16
},
"minItems": 0,
"maxItems": 16
},
"left_action": {
"type": "array",
"items": {
"type": "array",
"items": {
"type": "integer",
"minimum": 0,
"maximum": 15
},
"minItems": 0,
"maxItems": 16
},
"minItems": 1,
"maxItems": 6
},
"right_action": {
"type": "array",
"items": {
"type": "array",
"items": {
"type": "integer",
"minimum": 0,
"maximum": 15
},
"minItems": 0,
"maxItems": 16
},
"minItems": 1,
"maxItems": 6
},
"orbits": {
"type": "array",
"items": {
"type": "object",
"properties": {
"representative": {
"type": "integer",
"minimum": 0,
"maximum": 15
},
"points": {
"type": "array",
"items": {
"type": "integer",
"minimum": 0,
"maximum": 15
},
"minItems": 1,
"maxItems": 16
},
"stabilizer": {
"type": "array",
"items": {
"type": "array",
"items": {
"type": "integer",
"minimum": 0,
"maximum": 5
},
"minItems": 2,
"maxItems": 2
},
"minItems": 1,
"maxItems": 36
},
"left_projection": {
"type": "array",
"items": {
"type": "integer",
"minimum": 0,
"maximum": 5
},
"minItems": 1,
"maxItems": 6
},
"right_projection": {
"type": "array",
"items": {
"type": "integer",
"minimum": 0,
"maximum": 5
},
"minItems": 1,
"maxItems": 6
},
"left_kernel": {
"type": "array",
"items": {
"type": "integer",
"minimum": 0,
"maximum": 5
},
"minItems": 1,
"maxItems": 6
},
"right_kernel": {
"type": "array",
"items": {
"type": "integer",
"minimum": 0,
"maximum": 5
},
"minItems": 1,
"maxItems": 6
},
"quotient_pairs": {
"type": "array",
"items": {
"type": "array",
"items": {
"type": "array",
"items": {
"type": "integer",
"minimum": 0,
"maximum": 5
},
"minItems": 1,
"maxItems": 6
},
"minItems": 2,
"maxItems": 2
},
"minItems": 1,
"maxItems": 6
}
},
"required": [
"representative",
"points",
"stabilizer",
"left_projection",
"right_projection",
"left_kernel",
"right_kernel",
"quotient_pairs"
],
"additionalProperties": false
},
"minItems": 0,
"maxItems": 16
},
"complete": {
"const": true
}
},
"required": [
"classes",
"left_action",
"right_action",
"orbits",
"complete"
],
"additionalProperties": false
},
{
"type": "null"
}
]
}
},
"required": [
"g_table",
"h_table",
"k_table",
"u_size",
"v_size",
"u_left",
"u_right",
"v_left",
"v_right",
"claim"
],
"additionalProperties": false
}Published input example
{
"g_table": [
[
0,
1
],
[
1,
0
]
],
"h_table": [
[
0,
1
],
[
1,
0
]
],
"k_table": [
[
0,
1
],
[
1,
0
]
],
"u_size": 2,
"v_size": 2,
"u_left": [
[
0,
1
],
[
1,
0
]
],
"u_right": [
[
0,
1
],
[
1,
0
]
],
"v_left": [
[
0,
1
],
[
1,
0
]
],
"v_right": [
[
0,
1
],
[
1,
0
]
],
"claim": {
"classes": [
[
0,
3
],
[
1,
2
]
],
"left_action": [
[
0,
1
],
[
1,
0
]
],
"right_action": [
[
0,
1
],
[
1,
0
]
],
"orbits": [
{
"representative": 0,
"points": [
0,
1
],
"stabilizer": [
[
0,
0
],
[
1,
1
]
],
"left_projection": [
0,
1
],
"right_projection": [
0,
1
],
"left_kernel": [
0
],
"right_kernel": [
0
],
"quotient_pairs": [
[
[
0
],
[
0
]
],
[
[
1
],
[
1
]
]
]
}
],
"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.