Datenvertragswerk
latin bitrade switch family
For two fully captured Latin squares LEFT and RIGHT of the SAME order n1..4, reconstruct EVERY NONEMPTY cellmask on which replacing LEFT entries by RIGHT preserves a Latin square. Each original is a flat rowmajor n*n array with symbols0..n-1, each symbol once per row/column; LEFT is REDUCED: its first row AND first column must be0..n-1. RIGHT need not be reduced. ORIGINAL labels are retained; no automatic relabelling. A switchmask may select ONLY cells where left differs from right,.
POST https://datenvertrag.halowerk.com/v1/latin-bitrade-switch-familyInputs
| Field | Type | Required | Description |
|---|---|---|---|
| n | See schema | Yes | |
| left | See schema | Yes | |
| right | See schema | Yes | |
| claim | See schema | Yes |
Show full input schema
{
"type": "object",
"properties": {
"n": {
"anyOf": [
{
"type": "integer",
"minimum": 1,
"maximum": 4
},
{
"type": "null"
}
]
},
"left": {
"anyOf": [
{
"type": "array",
"items": {
"type": "integer",
"minimum": 0,
"maximum": 3
},
"minItems": 1,
"maxItems": 16
},
{
"type": "null"
}
]
},
"right": {
"anyOf": [
{
"type": "array",
"items": {
"type": "integer",
"minimum": 0,
"maximum": 3
},
"minItems": 1,
"maxItems": 16
},
{
"type": "null"
}
]
},
"claim": {
"anyOf": [
{
"type": "object",
"properties": {
"switch_masks": {
"type": "array",
"items": {
"type": "integer",
"minimum": 1,
"maximum": 65535
},
"minItems": 0,
"maxItems": 15
},
"hybrid_squares": {
"type": "array",
"items": {
"type": "array",
"items": {
"type": "integer",
"minimum": 0,
"maximum": 3
},
"minItems": 1,
"maxItems": 16
},
"minItems": 0,
"maxItems": 15
},
"minimal_masks": {
"type": "array",
"items": {
"type": "integer",
"minimum": 1,
"maximum": 65535
},
"minItems": 0,
"maxItems": 4
},
"count": {
"type": "integer",
"minimum": 0,
"maximum": 16
}
},
"required": [
"switch_masks",
"hybrid_squares",
"minimal_masks",
"count"
],
"additionalProperties": false
},
{
"type": "null"
}
]
}
},
"required": [
"n",
"left",
"right",
"claim"
],
"additionalProperties": false
}Published input example
{
"n": 1,
"left": [
0
],
"right": [
0
],
"claim": {
"switch_masks": [],
"hybrid_squares": [],
"minimal_masks": [],
"count": 0
}
}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.