HALOWERKDatenvertragswerk
latin partial transversal inventory
For one FULLY CAPTURED labelled LATIN SQUARE oforder1..4, square is itsflatROWMAJORsymbolarray ofexactlyorder*order entries0..order-1; everyrow/column containsallsymbolsexactlyonce. Reconstruct EVERY PARTIAL TRANSVERSAL ofEVERYsize: a subsetofcells withNOrepeatedROW,COLUMN,orSYMBOL. Includeemptyset,unextendablepartialchoices,andallmaximumchoices;notonlyfullsizeorder transversals. Cellmask bit(r*order+c) selects ORIGINALcell(r,c);preserveeveryrow/column/symbollabel,nosymmetryquotient. Return.
POST https://datenvertrag.halowerk.com/v1/latin-partial-transversal-inventoryEingaben
| Feld | Typ | Pflicht | Beschreibung |
|---|---|---|---|
| order | Siehe Schema | Ja | |
| square | Siehe Schema | Ja | |
| claim | Siehe Schema | Ja |
Vollständiges Eingabeschema anzeigen
{
"type": "object",
"properties": {
"order": {
"anyOf": [
{
"type": "integer",
"minimum": 1,
"maximum": 4
},
{
"type": "null"
}
]
},
"square": {
"anyOf": [
{
"type": "array",
"items": {
"type": "integer",
"minimum": 0,
"maximum": 3
},
"minItems": 1,
"maxItems": 16
},
{
"type": "null"
}
]
},
"claim": {
"anyOf": [
{
"type": "object",
"properties": {
"masks": {
"type": "array",
"items": {
"type": "integer",
"minimum": 0,
"maximum": 65535
},
"minItems": 0,
"maxItems": 256
},
"size_histogram": {
"type": "array",
"items": {
"type": "integer",
"minimum": 0,
"maximum": 256
},
"minItems": 1,
"maxItems": 5
},
"maximum_size": {
"type": "integer",
"minimum": 0,
"maximum": 4
},
"maximum_masks": {
"type": "array",
"items": {
"type": "integer",
"minimum": 0,
"maximum": 65535
},
"minItems": 0,
"maxItems": 256
}
},
"required": [
"masks",
"size_histogram",
"maximum_size",
"maximum_masks"
],
"additionalProperties": false
},
{
"type": "null"
}
]
}
},
"required": [
"order",
"square",
"claim"
],
"additionalProperties": false
}Veröffentlichtes Eingabebeispiel
{
"order": 1,
"square": [
0
],
"claim": {
"masks": [
0,
1
],
"size_histogram": [
1,
1
],
"maximum_size": 1,
"maximum_masks": [
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