HALOWERKDatenvertragswerk
latin square orthogonal mate family
For a fully captured Latin square of order1..4 on labels0..n-1, construct ALL Latin squares B for which every ordered pair (original[r][c],B[r][c]) occurs exactly once. Return every mate as a flat row-major value array in numeric lexicographic order, aligned pair_codes[r*n+c]=n*original[r][c]+B[r][c], and count. Retain every symbol-labelled mate; no symmetry quotient. A valid square without mates has a known empty family. n1 admits its single square as its mate. Compare the complete.
POST https://datenvertrag.halowerk.com/v1/latin-square-orthogonal-mate-familyEingaben
| Feld | Typ | Pflicht | Beschreibung |
|---|---|---|---|
| square | Siehe Schema | Ja | |
| claim | Siehe Schema | Ja |
Vollständiges Eingabeschema anzeigen
{
"type": "object",
"properties": {
"square": {
"anyOf": [
{
"type": "array",
"items": {
"type": "array",
"items": {
"type": "integer",
"minimum": 0,
"maximum": 3
},
"minItems": 1,
"maxItems": 4
},
"minItems": 1,
"maxItems": 4
},
{
"type": "null"
}
]
},
"claim": {
"anyOf": [
{
"type": "object",
"properties": {
"mates": {
"type": "array",
"items": {
"type": "array",
"items": {
"type": "integer",
"minimum": 0,
"maximum": 3
},
"minItems": 1,
"maxItems": 16
},
"minItems": 0,
"maxItems": 48
},
"pair_codes": {
"type": "array",
"items": {
"type": "array",
"items": {
"type": "integer",
"minimum": 0,
"maximum": 15
},
"minItems": 1,
"maxItems": 16
},
"minItems": 0,
"maxItems": 48
},
"count": {
"type": "integer",
"minimum": 0,
"maximum": 48
}
},
"required": [
"mates",
"pair_codes",
"count"
],
"additionalProperties": false
},
{
"type": "null"
}
]
}
},
"required": [
"square",
"claim"
],
"additionalProperties": false
}Veröffentlichtes Eingabebeispiel
{
"square": [
[
0
]
],
"claim": {
"mates": [
[
0
]
],
"pair_codes": [
[
0
]
],
"count": 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