HALOWERKDatenvertragswerk
finite group table of marks
Given a complete valid Cayley table on1..6fixedlabels0..n-1 with identity0, derive every subgroup and its conjugacy class, then the whole table of marks. Subgroups sort by numeric membership bitmask; conjugacy classes sort by their least mask, which represents that class. ROW i names coset stabilizer H_i and transitive left G-set G/H_i; COLUMN j names fixing subgroup H_j. Matrix entry counts left cosets gH_i fixed by EVERY element of H_j. This row/coset and column/fixer convention matches.
POST https://datenvertrag.halowerk.com/v1/finite-group-table-of-marksEingaben
| Feld | Typ | Pflicht | Beschreibung |
|---|---|---|---|
| table | Siehe Schema | Ja | |
| claimed_marks | Siehe Schema | Ja |
Vollständiges Eingabeschema anzeigen
{
"type": "object",
"additionalProperties": false,
"required": [
"table",
"claimed_marks"
],
"properties": {
"table": {
"anyOf": [
{
"type": "array",
"maxItems": 6,
"items": {
"type": "array",
"maxItems": 6,
"items": {
"type": "integer",
"minimum": 0,
"maximum": 5
},
"minItems": 1
},
"minItems": 1
},
{
"type": "null"
}
]
},
"claimed_marks": {
"anyOf": [
{
"type": "array",
"maxItems": 6,
"items": {
"type": "array",
"maxItems": 6,
"items": {
"type": "integer",
"minimum": 0,
"maximum": 6
}
}
},
{
"type": "null"
}
]
}
}
}Veröffentlichtes Eingabebeispiel
{
"table": [
[
0,
1,
2,
3,
4,
5
],
[
1,
0,
3,
2,
5,
4
],
[
2,
4,
0,
5,
1,
3
],
[
3,
5,
1,
4,
0,
2
],
[
4,
2,
5,
0,
3,
1
],
[
5,
3,
4,
1,
2,
0
]
],
"claimed_marks": [
[
6,
0,
0,
0
],
[
3,
1,
0,
0
],
[
2,
0,
2,
0
],
[
1,
1,
1,
1
]
]
}Ergebnis & Dokumentation
Maschinenlesbare Dokumentation dieses Hubs
Quelle dieser Seite: der veröffentlichte HALOWERK-Katalog. Stand: 2026-11-07, 02:42 UTC.
Weitere Endpunkte dieses Hubs
- Datenvertragswerk0,003 USDC
adjacency cospectral graph family
POSThttps://datenvertrag.halowerk.com/v1/adjacency-cospectral-graph-familyGiven n1..5 and a monic degree-n integer polynomial det(xI-A), return EVERY labelled simple undirected graph on vertices0..n-1 having exactly that adjacency characteristic polynomial over integers. Coefficients are descending degree order,
- 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.
- Datenvertragswerk0,003 USDC
aligned record cut audit
POSThttps://datenvertrag.halowerk.com/v1/aligned-record-cut-auditA stream-runtime fixture maintainer checks which record IDs belong to a supplied aligned checkpoint cut and which same-channel post-barrier records must stay buffered until all input barriers arrive. One aligned local checkpoint;record iden